20.04/9.90 YES 20.04/9.90 20.04/9.90 Ultimate: Cannot open display: 20.04/9.90 This is Ultimate 0.1.24-8dc7c08-m 20.04/9.90 [2019-03-28 22:35:46,977 INFO L170 SettingsManager]: Resetting all preferences to default values... 20.04/9.90 [2019-03-28 22:35:46,980 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 20.04/9.90 [2019-03-28 22:35:46,991 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 20.04/9.90 [2019-03-28 22:35:46,992 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 20.04/9.90 [2019-03-28 22:35:46,993 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 20.04/9.90 [2019-03-28 22:35:46,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 20.04/9.90 [2019-03-28 22:35:46,996 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 20.04/9.90 [2019-03-28 22:35:46,997 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 20.04/9.90 [2019-03-28 22:35:46,998 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 20.04/9.90 [2019-03-28 22:35:46,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 20.04/9.90 [2019-03-28 22:35:46,999 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 20.04/9.90 [2019-03-28 22:35:47,000 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 20.04/9.90 [2019-03-28 22:35:47,001 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 20.04/9.90 [2019-03-28 22:35:47,002 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 20.04/9.90 [2019-03-28 22:35:47,003 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 20.04/9.90 [2019-03-28 22:35:47,004 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 20.04/9.90 [2019-03-28 22:35:47,005 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 20.04/9.90 [2019-03-28 22:35:47,007 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 20.04/9.90 [2019-03-28 22:35:47,009 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 20.04/9.90 [2019-03-28 22:35:47,010 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 20.04/9.90 [2019-03-28 22:35:47,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 20.04/9.90 [2019-03-28 22:35:47,013 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 20.04/9.90 [2019-03-28 22:35:47,013 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 20.04/9.90 [2019-03-28 22:35:47,014 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 20.04/9.90 [2019-03-28 22:35:47,014 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 20.04/9.90 [2019-03-28 22:35:47,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 20.04/9.90 [2019-03-28 22:35:47,016 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 20.04/9.90 [2019-03-28 22:35:47,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 20.04/9.90 [2019-03-28 22:35:47,017 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 20.04/9.90 [2019-03-28 22:35:47,017 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 20.04/9.90 [2019-03-28 22:35:47,018 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 20.04/9.90 [2019-03-28 22:35:47,019 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 20.04/9.90 [2019-03-28 22:35:47,019 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 20.04/9.90 [2019-03-28 22:35:47,020 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 20.04/9.90 [2019-03-28 22:35:47,020 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 20.04/9.90 [2019-03-28 22:35:47,020 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 20.04/9.90 [2019-03-28 22:35:47,021 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 20.04/9.90 [2019-03-28 22:35:47,022 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 20.04/9.90 [2019-03-28 22:35:47,022 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 20.04/9.90 [2019-03-28 22:35:47,037 INFO L110 SettingsManager]: Loading preferences was successful 20.04/9.90 [2019-03-28 22:35:47,038 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 20.04/9.90 [2019-03-28 22:35:47,039 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 20.04/9.90 [2019-03-28 22:35:47,039 INFO L133 SettingsManager]: * Rewrite not-equals=true 20.04/9.90 [2019-03-28 22:35:47,039 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 20.04/9.90 [2019-03-28 22:35:47,039 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 20.04/9.90 [2019-03-28 22:35:47,039 INFO L133 SettingsManager]: * Use SBE=true 20.04/9.90 [2019-03-28 22:35:47,040 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 20.04/9.90 [2019-03-28 22:35:47,040 INFO L133 SettingsManager]: * Use old map elimination=false 20.04/9.90 [2019-03-28 22:35:47,040 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 20.04/9.90 [2019-03-28 22:35:47,040 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 20.04/9.90 [2019-03-28 22:35:47,040 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 20.04/9.90 [2019-03-28 22:35:47,041 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 20.04/9.90 [2019-03-28 22:35:47,041 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 20.04/9.90 [2019-03-28 22:35:47,041 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:47,041 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 20.04/9.90 [2019-03-28 22:35:47,041 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 20.04/9.90 [2019-03-28 22:35:47,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE 20.04/9.90 [2019-03-28 22:35:47,042 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 20.04/9.90 [2019-03-28 22:35:47,042 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 20.04/9.90 [2019-03-28 22:35:47,042 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 20.04/9.90 [2019-03-28 22:35:47,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 20.04/9.90 [2019-03-28 22:35:47,042 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 20.04/9.90 [2019-03-28 22:35:47,042 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 20.04/9.90 [2019-03-28 22:35:47,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.04/9.90 [2019-03-28 22:35:47,043 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 20.04/9.90 [2019-03-28 22:35:47,043 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 20.04/9.90 [2019-03-28 22:35:47,043 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 20.04/9.90 [2019-03-28 22:35:47,043 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 20.04/9.90 [2019-03-28 22:35:47,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 20.04/9.90 [2019-03-28 22:35:47,083 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 20.04/9.90 [2019-03-28 22:35:47,086 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 20.04/9.90 [2019-03-28 22:35:47,088 INFO L271 PluginConnector]: Initializing CDTParser... 20.04/9.90 [2019-03-28 22:35:47,088 INFO L276 PluginConnector]: CDTParser initialized 20.04/9.90 [2019-03-28 22:35:47,089 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 20.04/9.90 [2019-03-28 22:35:47,164 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/1a27979dd0fc4d7ca51b4932a79f31ef/FLAG17b48f94b 20.04/9.90 [2019-03-28 22:35:47,505 INFO L307 CDTParser]: Found 1 translation units. 20.04/9.90 [2019-03-28 22:35:47,505 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 20.04/9.90 [2019-03-28 22:35:47,512 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/1a27979dd0fc4d7ca51b4932a79f31ef/FLAG17b48f94b 20.04/9.90 [2019-03-28 22:35:47,931 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/1a27979dd0fc4d7ca51b4932a79f31ef 20.04/9.90 [2019-03-28 22:35:47,943 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 20.04/9.90 [2019-03-28 22:35:47,944 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 20.04/9.90 [2019-03-28 22:35:47,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 20.04/9.90 [2019-03-28 22:35:47,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 20.04/9.90 [2019-03-28 22:35:47,949 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 20.04/9.90 [2019-03-28 22:35:47,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:35:47" (1/1) ... 20.04/9.90 [2019-03-28 22:35:47,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e23a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:35:47, skipping insertion in model container 20.04/9.90 [2019-03-28 22:35:47,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:35:47" (1/1) ... 20.04/9.90 [2019-03-28 22:35:47,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 20.04/9.90 [2019-03-28 22:35:47,980 INFO L176 MainTranslator]: Built tables and reachable declarations 20.04/9.90 [2019-03-28 22:35:48,137 INFO L206 PostProcessor]: Analyzing one entry point: main 20.04/9.90 [2019-03-28 22:35:48,142 INFO L191 MainTranslator]: Completed pre-run 20.04/9.90 [2019-03-28 22:35:48,159 INFO L206 PostProcessor]: Analyzing one entry point: main 20.04/9.90 [2019-03-28 22:35:48,174 INFO L195 MainTranslator]: Completed translation 20.04/9.90 [2019-03-28 22:35:48,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:35:48 WrapperNode 20.04/9.90 [2019-03-28 22:35:48,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 20.04/9.90 [2019-03-28 22:35:48,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 20.04/9.90 [2019-03-28 22:35:48,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 20.04/9.90 [2019-03-28 22:35:48,176 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 20.04/9.90 [2019-03-28 22:35:48,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:35:48" (1/1) ... 20.04/9.90 [2019-03-28 22:35:48,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:35:48" (1/1) ... 20.04/9.90 [2019-03-28 22:35:48,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 20.04/9.90 [2019-03-28 22:35:48,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 20.04/9.90 [2019-03-28 22:35:48,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 20.04/9.90 [2019-03-28 22:35:48,266 INFO L276 PluginConnector]: Boogie Preprocessor initialized 20.04/9.90 [2019-03-28 22:35:48,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:35:48" (1/1) ... 20.04/9.90 [2019-03-28 22:35:48,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:35:48" (1/1) ... 20.04/9.90 [2019-03-28 22:35:48,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:35:48" (1/1) ... 20.04/9.90 [2019-03-28 22:35:48,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:35:48" (1/1) ... 20.04/9.90 [2019-03-28 22:35:48,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:35:48" (1/1) ... 20.04/9.90 [2019-03-28 22:35:48,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:35:48" (1/1) ... 20.04/9.90 [2019-03-28 22:35:48,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:35:48" (1/1) ... 20.04/9.90 [2019-03-28 22:35:48,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 20.04/9.90 [2019-03-28 22:35:48,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 20.04/9.90 [2019-03-28 22:35:48,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... 20.04/9.90 [2019-03-28 22:35:48,286 INFO L276 PluginConnector]: RCFGBuilder initialized 20.04/9.90 [2019-03-28 22:35:48,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:35:48" (1/1) ... 20.04/9.90 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.90 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 20.04/9.90 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.04/9.90 [2019-03-28 22:35:48,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 20.04/9.90 [2019-03-28 22:35:48,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 20.04/9.90 [2019-03-28 22:35:48,475 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 20.04/9.90 [2019-03-28 22:35:48,475 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 20.04/9.90 [2019-03-28 22:35:48,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:35:48 BoogieIcfgContainer 20.04/9.90 [2019-03-28 22:35:48,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 20.04/9.90 [2019-03-28 22:35:48,493 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 20.04/9.90 [2019-03-28 22:35:48,493 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 20.04/9.90 [2019-03-28 22:35:48,495 INFO L276 PluginConnector]: BlockEncodingV2 initialized 20.04/9.90 [2019-03-28 22:35:48,496 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:35:48" (1/1) ... 20.04/9.90 [2019-03-28 22:35:48,510 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges 20.04/9.90 [2019-03-28 22:35:48,512 INFO L258 BlockEncoder]: Using Remove infeasible edges 20.04/9.90 [2019-03-28 22:35:48,512 INFO L263 BlockEncoder]: Using Maximize final states 20.04/9.90 [2019-03-28 22:35:48,513 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 20.04/9.90 [2019-03-28 22:35:48,513 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 20.04/9.90 [2019-03-28 22:35:48,515 INFO L296 BlockEncoder]: Using Remove sink states 20.04/9.90 [2019-03-28 22:35:48,516 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 20.04/9.90 [2019-03-28 22:35:48,516 INFO L179 BlockEncoder]: Using Rewrite not-equals 20.04/9.90 [2019-03-28 22:35:48,532 INFO L185 BlockEncoder]: Using Use SBE 20.04/9.90 [2019-03-28 22:35:48,548 INFO L200 BlockEncoder]: SBE split 2 edges 20.04/9.90 [2019-03-28 22:35:48,553 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 20.04/9.90 [2019-03-28 22:35:48,555 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.04/9.90 [2019-03-28 22:35:48,565 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 20.04/9.90 [2019-03-28 22:35:48,567 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 20.04/9.90 [2019-03-28 22:35:48,568 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 20.04/9.90 [2019-03-28 22:35:48,568 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.04/9.90 [2019-03-28 22:35:48,573 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 20.04/9.90 [2019-03-28 22:35:48,573 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 20.04/9.90 [2019-03-28 22:35:48,574 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 20.04/9.90 [2019-03-28 22:35:48,574 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.04/9.90 [2019-03-28 22:35:48,574 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 20.04/9.90 [2019-03-28 22:35:48,574 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 20.04/9.90 [2019-03-28 22:35:48,575 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 5 edges 20.04/9.90 [2019-03-28 22:35:48,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:35:48 BasicIcfg 20.04/9.90 [2019-03-28 22:35:48,575 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 20.04/9.90 [2019-03-28 22:35:48,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 20.04/9.90 [2019-03-28 22:35:48,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... 20.04/9.90 [2019-03-28 22:35:48,580 INFO L276 PluginConnector]: TraceAbstraction initialized 20.04/9.90 [2019-03-28 22:35:48,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 10:35:47" (1/4) ... 20.04/9.90 [2019-03-28 22:35:48,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3702eea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:35:48, skipping insertion in model container 20.04/9.90 [2019-03-28 22:35:48,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:35:48" (2/4) ... 20.04/9.90 [2019-03-28 22:35:48,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3702eea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:35:48, skipping insertion in model container 20.04/9.90 [2019-03-28 22:35:48,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:35:48" (3/4) ... 20.04/9.90 [2019-03-28 22:35:48,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3702eea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:35:48, skipping insertion in model container 20.04/9.90 [2019-03-28 22:35:48,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:35:48" (4/4) ... 20.04/9.90 [2019-03-28 22:35:48,584 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.04/9.90 [2019-03-28 22:35:48,594 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 20.04/9.90 [2019-03-28 22:35:48,602 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 20.04/9.90 [2019-03-28 22:35:48,619 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 20.04/9.90 [2019-03-28 22:35:48,647 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.04/9.90 [2019-03-28 22:35:48,648 INFO L382 AbstractCegarLoop]: Interprodecural is true 20.04/9.90 [2019-03-28 22:35:48,648 INFO L383 AbstractCegarLoop]: Hoare is true 20.04/9.90 [2019-03-28 22:35:48,648 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 20.04/9.90 [2019-03-28 22:35:48,648 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 20.04/9.90 [2019-03-28 22:35:48,649 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.04/9.90 [2019-03-28 22:35:48,649 INFO L387 AbstractCegarLoop]: Difference is false 20.04/9.90 [2019-03-28 22:35:48,649 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 20.04/9.90 [2019-03-28 22:35:48,649 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 20.04/9.90 [2019-03-28 22:35:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. 20.04/9.90 [2019-03-28 22:35:48,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 20.04/9.90 [2019-03-28 22:35:48,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. 20.04/9.90 [2019-03-28 22:35:48,721 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 20.04/9.90 [2019-03-28 22:35:48,721 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. 20.04/9.90 [2019-03-28 22:35:48,722 INFO L451 ceAbstractionStarter]: At program point L20-2(lines 19 25) the Hoare annotation is: true 20.04/9.90 [2019-03-28 22:35:48,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:35:48 BasicIcfg 20.04/9.90 [2019-03-28 22:35:48,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 20.04/9.90 [2019-03-28 22:35:48,730 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 20.04/9.90 [2019-03-28 22:35:48,731 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 20.04/9.90 [2019-03-28 22:35:48,734 INFO L276 PluginConnector]: BuchiAutomizer initialized 20.04/9.90 [2019-03-28 22:35:48,735 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.04/9.90 [2019-03-28 22:35:48,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 10:35:47" (1/5) ... 20.04/9.90 [2019-03-28 22:35:48,736 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7090019f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:35:48, skipping insertion in model container 20.04/9.90 [2019-03-28 22:35:48,736 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.04/9.90 [2019-03-28 22:35:48,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:35:48" (2/5) ... 20.04/9.90 [2019-03-28 22:35:48,736 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7090019f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:35:48, skipping insertion in model container 20.04/9.90 [2019-03-28 22:35:48,736 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.04/9.90 [2019-03-28 22:35:48,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:35:48" (3/5) ... 20.04/9.90 [2019-03-28 22:35:48,737 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7090019f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:35:48, skipping insertion in model container 20.04/9.90 [2019-03-28 22:35:48,737 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.04/9.90 [2019-03-28 22:35:48,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:35:48" (4/5) ... 20.04/9.90 [2019-03-28 22:35:48,738 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7090019f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:35:48, skipping insertion in model container 20.04/9.90 [2019-03-28 22:35:48,738 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.04/9.90 [2019-03-28 22:35:48,738 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:35:48" (5/5) ... 20.04/9.90 [2019-03-28 22:35:48,739 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.04/9.90 [2019-03-28 22:35:48,767 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.04/9.90 [2019-03-28 22:35:48,768 INFO L374 BuchiCegarLoop]: Interprodecural is true 20.04/9.90 [2019-03-28 22:35:48,768 INFO L375 BuchiCegarLoop]: Hoare is true 20.04/9.90 [2019-03-28 22:35:48,768 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 20.04/9.90 [2019-03-28 22:35:48,768 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 20.04/9.90 [2019-03-28 22:35:48,768 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.04/9.90 [2019-03-28 22:35:48,769 INFO L379 BuchiCegarLoop]: Difference is false 20.04/9.90 [2019-03-28 22:35:48,769 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 20.04/9.90 [2019-03-28 22:35:48,769 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 20.04/9.90 [2019-03-28 22:35:48,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 20.04/9.90 [2019-03-28 22:35:48,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 20.04/9.90 [2019-03-28 22:35:48,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.04/9.90 [2019-03-28 22:35:48,791 INFO L119 BuchiIsEmpty]: Starting construction of run 20.04/9.90 [2019-03-28 22:35:48,797 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 20.04/9.90 [2019-03-28 22:35:48,797 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 20.04/9.90 [2019-03-28 22:35:48,797 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 20.04/9.90 [2019-03-28 22:35:48,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 20.04/9.90 [2019-03-28 22:35:48,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 20.04/9.90 [2019-03-28 22:35:48,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.04/9.90 [2019-03-28 22:35:48,798 INFO L119 BuchiIsEmpty]: Starting construction of run 20.04/9.90 [2019-03-28 22:35:48,798 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 20.04/9.90 [2019-03-28 22:35:48,798 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 20.04/9.90 [2019-03-28 22:35:48,804 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [50] ULTIMATE.startENTRY-->L20-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_13) (< 0 v_ULTIMATE.start_main_~y2~0_13)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 4#L20-2true 20.04/9.90 [2019-03-28 22:35:48,804 INFO L796 eck$LassoCheckResult]: Loop: 4#L20-2true [46] L20-2-->L20: Formula: (< v_ULTIMATE.start_main_~y1~0_12 v_ULTIMATE.start_main_~y2~0_12) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} AuxVars[] AssignedVars[] 5#L20true [39] L20-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~y2~0_1 v_ULTIMATE.start_main_~y1~0_2) (= v_ULTIMATE.start_main_~y1~0_1 (+ (* (- 1) v_ULTIMATE.start_main_~y2~0_1) v_ULTIMATE.start_main_~y1~0_2))) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_2, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_1} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_1, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~y1~0] 4#L20-2true 20.04/9.90 [2019-03-28 22:35:48,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash 81, now seen corresponding path program 1 times 20.04/9.90 [2019-03-28 22:35:48,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.90 [2019-03-28 22:35:48,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.90 [2019-03-28 22:35:48,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:48,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:48,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:48,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:48,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2426, now seen corresponding path program 1 times 20.04/9.90 [2019-03-28 22:35:48,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.90 [2019-03-28 22:35:48,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.90 [2019-03-28 22:35:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:48,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:48,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.04/9.90 [2019-03-28 22:35:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.04/9.90 [2019-03-28 22:35:48,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.04/9.90 [2019-03-28 22:35:48,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 20.04/9.90 [2019-03-28 22:35:48,944 INFO L811 eck$LassoCheckResult]: loop already infeasible 20.04/9.90 [2019-03-28 22:35:48,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.04/9.90 [2019-03-28 22:35:48,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.04/9.90 [2019-03-28 22:35:48,961 INFO L87 Difference]: Start difference. First operand 3 states. Second operand 3 states. 20.04/9.90 [2019-03-28 22:35:48,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.04/9.90 [2019-03-28 22:35:48,985 INFO L93 Difference]: Finished difference Result 4 states and 6 transitions. 20.04/9.90 [2019-03-28 22:35:48,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.04/9.90 [2019-03-28 22:35:48,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4 states and 6 transitions. 20.04/9.90 [2019-03-28 22:35:48,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 20.04/9.90 [2019-03-28 22:35:48,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4 states to 4 states and 6 transitions. 20.04/9.90 [2019-03-28 22:35:48,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 20.04/9.90 [2019-03-28 22:35:48,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 20.04/9.90 [2019-03-28 22:35:48,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 6 transitions. 20.04/9.90 [2019-03-28 22:35:48,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.04/9.90 [2019-03-28 22:35:48,999 INFO L706 BuchiCegarLoop]: Abstraction has 4 states and 6 transitions. 20.04/9.90 [2019-03-28 22:35:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states and 6 transitions. 20.04/9.90 [2019-03-28 22:35:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. 20.04/9.90 [2019-03-28 22:35:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.04/9.90 [2019-03-28 22:35:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. 20.04/9.90 [2019-03-28 22:35:49,029 INFO L729 BuchiCegarLoop]: Abstraction has 4 states and 6 transitions. 20.04/9.90 [2019-03-28 22:35:49,029 INFO L609 BuchiCegarLoop]: Abstraction has 4 states and 6 transitions. 20.04/9.90 [2019-03-28 22:35:49,029 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 20.04/9.90 [2019-03-28 22:35:49,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 6 transitions. 20.04/9.90 [2019-03-28 22:35:49,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 20.04/9.90 [2019-03-28 22:35:49,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.04/9.90 [2019-03-28 22:35:49,030 INFO L119 BuchiIsEmpty]: Starting construction of run 20.04/9.90 [2019-03-28 22:35:49,031 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 20.04/9.90 [2019-03-28 22:35:49,031 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 20.04/9.90 [2019-03-28 22:35:49,031 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRY [50] ULTIMATE.startENTRY-->L20-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_13) (< 0 v_ULTIMATE.start_main_~y2~0_13)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 17#L20-2 20.04/9.90 [2019-03-28 22:35:49,031 INFO L796 eck$LassoCheckResult]: Loop: 17#L20-2 [46] L20-2-->L20: Formula: (< v_ULTIMATE.start_main_~y1~0_12 v_ULTIMATE.start_main_~y2~0_12) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} AuxVars[] AssignedVars[] 18#L20 [43] L20-->L20-2: Formula: (and (>= v_ULTIMATE.start_main_~y2~0_8 v_ULTIMATE.start_main_~y1~0_8) (= v_ULTIMATE.start_main_~y2~0_7 (+ v_ULTIMATE.start_main_~y2~0_8 (* (- 1) v_ULTIMATE.start_main_~y1~0_8)))) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_8, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_8} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_8, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y2~0] 17#L20-2 20.04/9.90 [2019-03-28 22:35:49,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:49,032 INFO L82 PathProgramCache]: Analyzing trace with hash 81, now seen corresponding path program 2 times 20.04/9.90 [2019-03-28 22:35:49,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.90 [2019-03-28 22:35:49,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.90 [2019-03-28 22:35:49,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:49,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:49,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2430, now seen corresponding path program 1 times 20.04/9.90 [2019-03-28 22:35:49,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.90 [2019-03-28 22:35:49,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.90 [2019-03-28 22:35:49,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:49,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:49,048 INFO L82 PathProgramCache]: Analyzing trace with hash 79310, now seen corresponding path program 1 times 20.04/9.90 [2019-03-28 22:35:49,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.90 [2019-03-28 22:35:49,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.90 [2019-03-28 22:35:49,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:49,114 INFO L216 LassoAnalysis]: Preferences: 20.04/9.90 [2019-03-28 22:35:49,115 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.04/9.90 [2019-03-28 22:35:49,116 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.04/9.90 [2019-03-28 22:35:49,116 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.04/9.90 [2019-03-28 22:35:49,116 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.04/9.90 [2019-03-28 22:35:49,116 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:49,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.04/9.90 [2019-03-28 22:35:49,117 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.04/9.90 [2019-03-28 22:35:49,117 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 20.04/9.90 [2019-03-28 22:35:49,117 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.04/9.90 [2019-03-28 22:35:49,117 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.04/9.90 [2019-03-28 22:35:49,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:49,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:49,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:49,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:49,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:49,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:49,253 INFO L300 LassoAnalysis]: Preprocessing complete. 20.04/9.90 [2019-03-28 22:35:49,254 INFO L412 LassoAnalysis]: Checking for nontermination... 20.04/9.90 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.90 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.90 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:49,260 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.04/9.90 [2019-03-28 22:35:49,261 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.90 [2019-03-28 22:35:49,268 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.04/9.90 [2019-03-28 22:35:49,268 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.04/9.90 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.90 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.90 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:49,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.04/9.90 [2019-03-28 22:35:49,299 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.90 [2019-03-28 22:35:49,326 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.04/9.90 [2019-03-28 22:35:49,326 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.04/9.90 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.90 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.90 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:49,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.04/9.90 [2019-03-28 22:35:49,332 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.90 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.90 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.90 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:49,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.04/9.90 [2019-03-28 22:35:49,365 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.90 [2019-03-28 22:35:49,549 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.04/9.90 [2019-03-28 22:35:49,552 INFO L216 LassoAnalysis]: Preferences: 20.04/9.90 [2019-03-28 22:35:49,552 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.04/9.90 [2019-03-28 22:35:49,552 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.04/9.90 [2019-03-28 22:35:49,552 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.04/9.90 [2019-03-28 22:35:49,552 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.04/9.90 [2019-03-28 22:35:49,552 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:49,552 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.04/9.90 [2019-03-28 22:35:49,553 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.04/9.90 [2019-03-28 22:35:49,553 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 20.04/9.90 [2019-03-28 22:35:49,553 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.04/9.90 [2019-03-28 22:35:49,553 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.04/9.90 [2019-03-28 22:35:49,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:49,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:49,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:49,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:49,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:49,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:49,644 INFO L300 LassoAnalysis]: Preprocessing complete. 20.04/9.90 [2019-03-28 22:35:49,650 INFO L497 LassoAnalysis]: Using template 'affine'. 20.04/9.90 [2019-03-28 22:35:49,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.04/9.90 Termination analysis: LINEAR_WITH_GUESSES 20.04/9.90 Number of strict supporting invariants: 0 20.04/9.90 Number of non-strict supporting invariants: 1 20.04/9.90 Consider only non-deceasing supporting invariants: true 20.04/9.90 Simplify termination arguments: true 20.04/9.90 Simplify supporting invariants: trueOverapproximate stem: false 20.04/9.90 [2019-03-28 22:35:49,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.04/9.90 [2019-03-28 22:35:49,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.04/9.90 [2019-03-28 22:35:49,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.04/9.90 [2019-03-28 22:35:49,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.04/9.90 [2019-03-28 22:35:49,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.04/9.90 [2019-03-28 22:35:49,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.04/9.90 [2019-03-28 22:35:49,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.04/9.90 [2019-03-28 22:35:49,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.04/9.90 [2019-03-28 22:35:49,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.04/9.90 Termination analysis: LINEAR_WITH_GUESSES 20.04/9.90 Number of strict supporting invariants: 0 20.04/9.90 Number of non-strict supporting invariants: 1 20.04/9.90 Consider only non-deceasing supporting invariants: true 20.04/9.90 Simplify termination arguments: true 20.04/9.90 Simplify supporting invariants: trueOverapproximate stem: false 20.04/9.90 [2019-03-28 22:35:49,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.04/9.90 [2019-03-28 22:35:49,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.04/9.90 [2019-03-28 22:35:49,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.04/9.90 [2019-03-28 22:35:49,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.04/9.90 [2019-03-28 22:35:49,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.04/9.90 [2019-03-28 22:35:49,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.04/9.90 [2019-03-28 22:35:49,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.04/9.90 [2019-03-28 22:35:49,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.04/9.90 Termination analysis: LINEAR_WITH_GUESSES 20.04/9.90 Number of strict supporting invariants: 0 20.04/9.90 Number of non-strict supporting invariants: 1 20.04/9.90 Consider only non-deceasing supporting invariants: true 20.04/9.90 Simplify termination arguments: true 20.04/9.90 Simplify supporting invariants: trueOverapproximate stem: false 20.04/9.90 [2019-03-28 22:35:49,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.04/9.90 [2019-03-28 22:35:49,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.04/9.90 [2019-03-28 22:35:49,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.04/9.90 [2019-03-28 22:35:49,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.04/9.90 [2019-03-28 22:35:49,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.04/9.90 [2019-03-28 22:35:49,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.04/9.90 [2019-03-28 22:35:49,716 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.04/9.90 [2019-03-28 22:35:49,744 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. 20.04/9.90 [2019-03-28 22:35:49,745 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. 20.04/9.90 [2019-03-28 22:35:49,747 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.04/9.90 [2019-03-28 22:35:49,750 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 20.04/9.90 [2019-03-28 22:35:49,751 INFO L518 LassoAnalysis]: Proved termination. 20.04/9.90 [2019-03-28 22:35:49,751 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.04/9.90 Ranking function f(ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_~y2~0) = -1*ULTIMATE.start_main_~y1~0 + 1*ULTIMATE.start_main_~y2~0 20.04/9.90 Supporting invariants [1*ULTIMATE.start_main_~y1~0 - 1 >= 0] 20.04/9.90 [2019-03-28 22:35:49,755 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed 20.04/9.90 [2019-03-28 22:35:49,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.04/9.90 [2019-03-28 22:35:49,806 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 3 conjunts are in the unsatisfiable core 20.04/9.90 [2019-03-28 22:35:49,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.04/9.90 [2019-03-28 22:35:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.04/9.90 [2019-03-28 22:35:49,816 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core 20.04/9.90 [2019-03-28 22:35:49,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.04/9.90 [2019-03-28 22:35:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.04/9.90 [2019-03-28 22:35:49,829 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 20.04/9.90 [2019-03-28 22:35:49,832 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 20.04/9.90 [2019-03-28 22:35:49,833 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states and 6 transitions. cyclomatic complexity: 3 Second operand 3 states. 20.04/9.90 [2019-03-28 22:35:49,895 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states and 6 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 23 transitions. Complement of second has 6 states. 20.04/9.90 [2019-03-28 22:35:49,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 20.04/9.90 [2019-03-28 22:35:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 20.04/9.90 [2019-03-28 22:35:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. 20.04/9.90 [2019-03-28 22:35:49,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 1 letters. Loop has 2 letters. 20.04/9.90 [2019-03-28 22:35:49,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.90 [2019-03-28 22:35:49,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 2 letters. 20.04/9.90 [2019-03-28 22:35:49,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.90 [2019-03-28 22:35:49,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 1 letters. Loop has 4 letters. 20.04/9.90 [2019-03-28 22:35:49,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.90 [2019-03-28 22:35:49,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 23 transitions. 20.04/9.90 [2019-03-28 22:35:49,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 20.04/9.90 [2019-03-28 22:35:49,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 15 transitions. 20.04/9.90 [2019-03-28 22:35:49,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 20.04/9.90 [2019-03-28 22:35:49,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 20.04/9.90 [2019-03-28 22:35:49,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 15 transitions. 20.04/9.90 [2019-03-28 22:35:49,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.04/9.90 [2019-03-28 22:35:49,908 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 15 transitions. 20.04/9.90 [2019-03-28 22:35:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 15 transitions. 20.04/9.90 [2019-03-28 22:35:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. 20.04/9.90 [2019-03-28 22:35:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 20.04/9.90 [2019-03-28 22:35:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. 20.04/9.90 [2019-03-28 22:35:49,910 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 14 transitions. 20.04/9.90 [2019-03-28 22:35:49,910 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 14 transitions. 20.04/9.90 [2019-03-28 22:35:49,910 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 20.04/9.90 [2019-03-28 22:35:49,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 14 transitions. 20.04/9.90 [2019-03-28 22:35:49,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 20.04/9.90 [2019-03-28 22:35:49,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.04/9.90 [2019-03-28 22:35:49,911 INFO L119 BuchiIsEmpty]: Starting construction of run 20.04/9.90 [2019-03-28 22:35:49,912 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 20.04/9.90 [2019-03-28 22:35:49,912 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 20.04/9.90 [2019-03-28 22:35:49,912 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY [50] ULTIMATE.startENTRY-->L20-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_13) (< 0 v_ULTIMATE.start_main_~y2~0_13)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 75#L20-2 [47] L20-2-->L20: Formula: (> v_ULTIMATE.start_main_~y1~0_12 v_ULTIMATE.start_main_~y2~0_12) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} AuxVars[] AssignedVars[] 81#L20 [39] L20-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~y2~0_1 v_ULTIMATE.start_main_~y1~0_2) (= v_ULTIMATE.start_main_~y1~0_1 (+ (* (- 1) v_ULTIMATE.start_main_~y2~0_1) v_ULTIMATE.start_main_~y1~0_2))) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_2, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_1} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_1, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~y1~0] 76#L20-2 20.04/9.90 [2019-03-28 22:35:49,912 INFO L796 eck$LassoCheckResult]: Loop: 76#L20-2 [46] L20-2-->L20: Formula: (< v_ULTIMATE.start_main_~y1~0_12 v_ULTIMATE.start_main_~y2~0_12) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} AuxVars[] AssignedVars[] 77#L20 [43] L20-->L20-2: Formula: (and (>= v_ULTIMATE.start_main_~y2~0_8 v_ULTIMATE.start_main_~y1~0_8) (= v_ULTIMATE.start_main_~y2~0_7 (+ v_ULTIMATE.start_main_~y2~0_8 (* (- 1) v_ULTIMATE.start_main_~y1~0_8)))) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_8, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_8} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_8, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y2~0] 76#L20-2 20.04/9.90 [2019-03-28 22:35:49,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:49,913 INFO L82 PathProgramCache]: Analyzing trace with hash 79337, now seen corresponding path program 1 times 20.04/9.90 [2019-03-28 22:35:49,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.90 [2019-03-28 22:35:49,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.90 [2019-03-28 22:35:49,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:49,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:49,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2430, now seen corresponding path program 2 times 20.04/9.90 [2019-03-28 22:35:49,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.90 [2019-03-28 22:35:49,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.90 [2019-03-28 22:35:49,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:49,927 INFO L82 PathProgramCache]: Analyzing trace with hash 76244326, now seen corresponding path program 1 times 20.04/9.90 [2019-03-28 22:35:49,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.90 [2019-03-28 22:35:49,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.90 [2019-03-28 22:35:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:49,974 INFO L216 LassoAnalysis]: Preferences: 20.04/9.90 [2019-03-28 22:35:49,975 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.04/9.90 [2019-03-28 22:35:49,975 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.04/9.90 [2019-03-28 22:35:49,975 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.04/9.90 [2019-03-28 22:35:49,975 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.04/9.90 [2019-03-28 22:35:49,975 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:49,975 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.04/9.90 [2019-03-28 22:35:49,976 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.04/9.90 [2019-03-28 22:35:49,976 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 20.04/9.90 [2019-03-28 22:35:49,976 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.04/9.90 [2019-03-28 22:35:49,976 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.04/9.90 [2019-03-28 22:35:49,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:49,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:49,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,064 INFO L300 LassoAnalysis]: Preprocessing complete. 20.04/9.90 [2019-03-28 22:35:50,064 INFO L412 LassoAnalysis]: Checking for nontermination... 20.04/9.90 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.90 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.90 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:50,070 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.04/9.90 [2019-03-28 22:35:50,070 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.90 [2019-03-28 22:35:50,098 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.04/9.90 [2019-03-28 22:35:50,098 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.04/9.90 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.90 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.90 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:50,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.04/9.90 [2019-03-28 22:35:50,104 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.90 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.90 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.90 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:50,139 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.04/9.90 [2019-03-28 22:35:50,139 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.90 [2019-03-28 22:35:50,328 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.04/9.90 [2019-03-28 22:35:50,330 INFO L216 LassoAnalysis]: Preferences: 20.04/9.90 [2019-03-28 22:35:50,331 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.04/9.90 [2019-03-28 22:35:50,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.04/9.90 [2019-03-28 22:35:50,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.04/9.90 [2019-03-28 22:35:50,331 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.04/9.90 [2019-03-28 22:35:50,331 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:50,332 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.04/9.90 [2019-03-28 22:35:50,332 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.04/9.90 [2019-03-28 22:35:50,332 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 20.04/9.90 [2019-03-28 22:35:50,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.04/9.90 [2019-03-28 22:35:50,332 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.04/9.90 [2019-03-28 22:35:50,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,418 INFO L300 LassoAnalysis]: Preprocessing complete. 20.04/9.90 [2019-03-28 22:35:50,419 INFO L497 LassoAnalysis]: Using template 'affine'. 20.04/9.90 [2019-03-28 22:35:50,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.04/9.90 Termination analysis: LINEAR_WITH_GUESSES 20.04/9.90 Number of strict supporting invariants: 0 20.04/9.90 Number of non-strict supporting invariants: 1 20.04/9.90 Consider only non-deceasing supporting invariants: true 20.04/9.90 Simplify termination arguments: true 20.04/9.90 Simplify supporting invariants: trueOverapproximate stem: false 20.04/9.90 [2019-03-28 22:35:50,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.04/9.90 [2019-03-28 22:35:50,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.04/9.90 [2019-03-28 22:35:50,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.04/9.90 [2019-03-28 22:35:50,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.04/9.90 [2019-03-28 22:35:50,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.04/9.90 [2019-03-28 22:35:50,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.04/9.90 [2019-03-28 22:35:50,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.04/9.90 [2019-03-28 22:35:50,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.04/9.90 Termination analysis: LINEAR_WITH_GUESSES 20.04/9.90 Number of strict supporting invariants: 0 20.04/9.90 Number of non-strict supporting invariants: 1 20.04/9.90 Consider only non-deceasing supporting invariants: true 20.04/9.90 Simplify termination arguments: true 20.04/9.90 Simplify supporting invariants: trueOverapproximate stem: false 20.04/9.90 [2019-03-28 22:35:50,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.04/9.90 [2019-03-28 22:35:50,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.04/9.90 [2019-03-28 22:35:50,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.04/9.90 [2019-03-28 22:35:50,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.04/9.90 [2019-03-28 22:35:50,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.04/9.90 [2019-03-28 22:35:50,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.04/9.90 [2019-03-28 22:35:50,448 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.04/9.90 [2019-03-28 22:35:50,457 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 20.04/9.90 [2019-03-28 22:35:50,457 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. 20.04/9.90 [2019-03-28 22:35:50,457 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.04/9.90 [2019-03-28 22:35:50,459 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 20.04/9.90 [2019-03-28 22:35:50,460 INFO L518 LassoAnalysis]: Proved termination. 20.04/9.90 [2019-03-28 22:35:50,460 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.04/9.90 Ranking function f(ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_~y2~0) = -1*ULTIMATE.start_main_~y1~0 + 1*ULTIMATE.start_main_~y2~0 20.04/9.90 Supporting invariants [1*ULTIMATE.start_main_~y1~0 - 1 >= 0] 20.04/9.90 [2019-03-28 22:35:50,462 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed 20.04/9.90 [2019-03-28 22:35:50,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.04/9.90 [2019-03-28 22:35:50,502 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 20.04/9.90 [2019-03-28 22:35:50,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.04/9.90 [2019-03-28 22:35:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.04/9.90 [2019-03-28 22:35:50,524 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core 20.04/9.90 [2019-03-28 22:35:50,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.04/9.90 [2019-03-28 22:35:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.04/9.90 [2019-03-28 22:35:50,547 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 20.04/9.90 [2019-03-28 22:35:50,547 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates 20.04/9.90 [2019-03-28 22:35:50,547 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states and 14 transitions. cyclomatic complexity: 8 Second operand 4 states. 20.04/9.90 [2019-03-28 22:35:50,613 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states and 14 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 51 states and 84 transitions. Complement of second has 29 states. 20.04/9.90 [2019-03-28 22:35:50,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states 20.04/9.90 [2019-03-28 22:35:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.04/9.90 [2019-03-28 22:35:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. 20.04/9.90 [2019-03-28 22:35:50,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 3 letters. Loop has 2 letters. 20.04/9.90 [2019-03-28 22:35:50,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.90 [2019-03-28 22:35:50,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 5 letters. Loop has 2 letters. 20.04/9.90 [2019-03-28 22:35:50,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.90 [2019-03-28 22:35:50,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 3 letters. Loop has 4 letters. 20.04/9.90 [2019-03-28 22:35:50,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.90 [2019-03-28 22:35:50,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 84 transitions. 20.04/9.90 [2019-03-28 22:35:50,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 20.04/9.90 [2019-03-28 22:35:50,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 13 states and 19 transitions. 20.04/9.90 [2019-03-28 22:35:50,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 20.04/9.90 [2019-03-28 22:35:50,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 20.04/9.90 [2019-03-28 22:35:50,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. 20.04/9.90 [2019-03-28 22:35:50,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.04/9.90 [2019-03-28 22:35:50,622 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. 20.04/9.90 [2019-03-28 22:35:50,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. 20.04/9.90 [2019-03-28 22:35:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. 20.04/9.90 [2019-03-28 22:35:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 20.04/9.90 [2019-03-28 22:35:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. 20.04/9.90 [2019-03-28 22:35:50,623 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. 20.04/9.90 [2019-03-28 22:35:50,623 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. 20.04/9.90 [2019-03-28 22:35:50,623 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 20.04/9.90 [2019-03-28 22:35:50,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. 20.04/9.90 [2019-03-28 22:35:50,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 20.04/9.90 [2019-03-28 22:35:50,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.04/9.90 [2019-03-28 22:35:50,624 INFO L119 BuchiIsEmpty]: Starting construction of run 20.04/9.90 [2019-03-28 22:35:50,624 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 20.04/9.90 [2019-03-28 22:35:50,624 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 20.04/9.90 [2019-03-28 22:35:50,624 INFO L794 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY [50] ULTIMATE.startENTRY-->L20-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_13) (< 0 v_ULTIMATE.start_main_~y2~0_13)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 207#L20-2 20.04/9.90 [2019-03-28 22:35:50,625 INFO L796 eck$LassoCheckResult]: Loop: 207#L20-2 [47] L20-2-->L20: Formula: (> v_ULTIMATE.start_main_~y1~0_12 v_ULTIMATE.start_main_~y2~0_12) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} AuxVars[] AssignedVars[] 209#L20 [39] L20-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~y2~0_1 v_ULTIMATE.start_main_~y1~0_2) (= v_ULTIMATE.start_main_~y1~0_1 (+ (* (- 1) v_ULTIMATE.start_main_~y2~0_1) v_ULTIMATE.start_main_~y1~0_2))) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_2, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_1} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_1, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~y1~0] 207#L20-2 20.04/9.90 [2019-03-28 22:35:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:50,625 INFO L82 PathProgramCache]: Analyzing trace with hash 81, now seen corresponding path program 3 times 20.04/9.90 [2019-03-28 22:35:50,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.90 [2019-03-28 22:35:50,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.90 [2019-03-28 22:35:50,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:50,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:50,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:50,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:50,631 INFO L82 PathProgramCache]: Analyzing trace with hash 2457, now seen corresponding path program 1 times 20.04/9.90 [2019-03-28 22:35:50,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.90 [2019-03-28 22:35:50,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.90 [2019-03-28 22:35:50,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:50,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:50,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:50,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:50,636 INFO L82 PathProgramCache]: Analyzing trace with hash 79337, now seen corresponding path program 2 times 20.04/9.90 [2019-03-28 22:35:50,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.90 [2019-03-28 22:35:50,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.90 [2019-03-28 22:35:50,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:50,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:50,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:50,659 INFO L216 LassoAnalysis]: Preferences: 20.04/9.90 [2019-03-28 22:35:50,660 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.04/9.90 [2019-03-28 22:35:50,660 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.04/9.90 [2019-03-28 22:35:50,660 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.04/9.90 [2019-03-28 22:35:50,660 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.04/9.90 [2019-03-28 22:35:50,660 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:50,660 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.04/9.90 [2019-03-28 22:35:50,660 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.04/9.90 [2019-03-28 22:35:50,661 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 20.04/9.90 [2019-03-28 22:35:50,661 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.04/9.90 [2019-03-28 22:35:50,661 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.04/9.90 [2019-03-28 22:35:50,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,745 INFO L300 LassoAnalysis]: Preprocessing complete. 20.04/9.90 [2019-03-28 22:35:50,745 INFO L412 LassoAnalysis]: Checking for nontermination... 20.04/9.90 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.90 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.90 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:50,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.04/9.90 [2019-03-28 22:35:50,756 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.90 [2019-03-28 22:35:50,759 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.04/9.90 [2019-03-28 22:35:50,760 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.04/9.90 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.90 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.90 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:50,787 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.04/9.90 [2019-03-28 22:35:50,787 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.90 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.90 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.90 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:50,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.04/9.90 [2019-03-28 22:35:50,819 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.90 [2019-03-28 22:35:50,991 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.04/9.90 [2019-03-28 22:35:50,993 INFO L216 LassoAnalysis]: Preferences: 20.04/9.90 [2019-03-28 22:35:50,994 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.04/9.90 [2019-03-28 22:35:50,994 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.04/9.90 [2019-03-28 22:35:50,994 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.04/9.90 [2019-03-28 22:35:50,994 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.04/9.90 [2019-03-28 22:35:50,994 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.04/9.90 [2019-03-28 22:35:50,995 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.04/9.90 [2019-03-28 22:35:50,995 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.04/9.90 [2019-03-28 22:35:50,995 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 20.04/9.90 [2019-03-28 22:35:50,995 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.04/9.90 [2019-03-28 22:35:50,995 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.04/9.90 [2019-03-28 22:35:50,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:50,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:51,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:51,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:51,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:51,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.90 [2019-03-28 22:35:51,055 INFO L300 LassoAnalysis]: Preprocessing complete. 20.04/9.90 [2019-03-28 22:35:51,055 INFO L497 LassoAnalysis]: Using template 'affine'. 20.04/9.90 [2019-03-28 22:35:51,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.04/9.90 Termination analysis: LINEAR_WITH_GUESSES 20.04/9.90 Number of strict supporting invariants: 0 20.04/9.90 Number of non-strict supporting invariants: 1 20.04/9.90 Consider only non-deceasing supporting invariants: true 20.04/9.90 Simplify termination arguments: true 20.04/9.90 Simplify supporting invariants: trueOverapproximate stem: false 20.04/9.90 [2019-03-28 22:35:51,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.04/9.90 [2019-03-28 22:35:51,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.04/9.90 [2019-03-28 22:35:51,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.04/9.90 [2019-03-28 22:35:51,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.04/9.90 [2019-03-28 22:35:51,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.04/9.90 [2019-03-28 22:35:51,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.04/9.90 [2019-03-28 22:35:51,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.04/9.90 [2019-03-28 22:35:51,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.04/9.90 [2019-03-28 22:35:51,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.04/9.90 Termination analysis: LINEAR_WITH_GUESSES 20.04/9.90 Number of strict supporting invariants: 0 20.04/9.90 Number of non-strict supporting invariants: 1 20.04/9.90 Consider only non-deceasing supporting invariants: true 20.04/9.90 Simplify termination arguments: true 20.04/9.90 Simplify supporting invariants: trueOverapproximate stem: false 20.04/9.90 [2019-03-28 22:35:51,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.04/9.90 [2019-03-28 22:35:51,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.04/9.90 [2019-03-28 22:35:51,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.04/9.90 [2019-03-28 22:35:51,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.04/9.90 [2019-03-28 22:35:51,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.04/9.90 [2019-03-28 22:35:51,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.04/9.90 [2019-03-28 22:35:51,093 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.04/9.90 [2019-03-28 22:35:51,102 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 20.04/9.90 [2019-03-28 22:35:51,102 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. 20.04/9.90 [2019-03-28 22:35:51,103 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.04/9.90 [2019-03-28 22:35:51,104 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. 20.04/9.90 [2019-03-28 22:35:51,105 INFO L518 LassoAnalysis]: Proved termination. 20.04/9.90 [2019-03-28 22:35:51,105 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.04/9.90 Ranking function f(ULTIMATE.start_main_~y1~0) = 2*ULTIMATE.start_main_~y1~0 + 1 20.04/9.90 Supporting invariants [1*ULTIMATE.start_main_~y1~0 >= 0, 1*ULTIMATE.start_main_~y2~0 - 1 >= 0] 20.04/9.90 [2019-03-28 22:35:51,109 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed 20.04/9.90 [2019-03-28 22:35:51,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.04/9.90 [2019-03-28 22:35:51,152 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 3 conjunts are in the unsatisfiable core 20.04/9.90 [2019-03-28 22:35:51,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.04/9.90 [2019-03-28 22:35:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.04/9.90 [2019-03-28 22:35:51,157 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core 20.04/9.90 [2019-03-28 22:35:51,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.04/9.90 [2019-03-28 22:35:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.04/9.90 [2019-03-28 22:35:51,201 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.04/9.90 [2019-03-28 22:35:51,201 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 20.04/9.90 [2019-03-28 22:35:51,202 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. 20.04/9.90 [2019-03-28 22:35:51,263 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 17 states and 25 transitions. Complement of second has 10 states. 20.04/9.90 [2019-03-28 22:35:51,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 20.04/9.90 [2019-03-28 22:35:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 20.04/9.90 [2019-03-28 22:35:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. 20.04/9.90 [2019-03-28 22:35:51,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 1 letters. Loop has 2 letters. 20.04/9.90 [2019-03-28 22:35:51,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.90 [2019-03-28 22:35:51,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 3 letters. Loop has 2 letters. 20.04/9.90 [2019-03-28 22:35:51,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.90 [2019-03-28 22:35:51,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 1 letters. Loop has 4 letters. 20.04/9.90 [2019-03-28 22:35:51,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.90 [2019-03-28 22:35:51,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 25 transitions. 20.04/9.90 [2019-03-28 22:35:51,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 20.04/9.90 [2019-03-28 22:35:51,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 17 transitions. 20.04/9.90 [2019-03-28 22:35:51,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 20.04/9.90 [2019-03-28 22:35:51,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 20.04/9.90 [2019-03-28 22:35:51,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. 20.04/9.90 [2019-03-28 22:35:51,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.04/9.90 [2019-03-28 22:35:51,269 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. 20.04/9.90 [2019-03-28 22:35:51,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. 20.04/9.90 [2019-03-28 22:35:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. 20.04/9.90 [2019-03-28 22:35:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 20.04/9.90 [2019-03-28 22:35:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. 20.04/9.90 [2019-03-28 22:35:51,271 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. 20.04/9.90 [2019-03-28 22:35:51,271 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. 20.04/9.90 [2019-03-28 22:35:51,271 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 20.04/9.90 [2019-03-28 22:35:51,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. 20.04/9.90 [2019-03-28 22:35:51,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 20.04/9.90 [2019-03-28 22:35:51,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.04/9.90 [2019-03-28 22:35:51,272 INFO L119 BuchiIsEmpty]: Starting construction of run 20.04/9.90 [2019-03-28 22:35:51,272 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 20.04/9.90 [2019-03-28 22:35:51,272 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 20.04/9.90 [2019-03-28 22:35:51,273 INFO L794 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY [50] ULTIMATE.startENTRY-->L20-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_13) (< 0 v_ULTIMATE.start_main_~y2~0_13)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 283#L20-2 [46] L20-2-->L20: Formula: (< v_ULTIMATE.start_main_~y1~0_12 v_ULTIMATE.start_main_~y2~0_12) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} AuxVars[] AssignedVars[] 284#L20 [43] L20-->L20-2: Formula: (and (>= v_ULTIMATE.start_main_~y2~0_8 v_ULTIMATE.start_main_~y1~0_8) (= v_ULTIMATE.start_main_~y2~0_7 (+ v_ULTIMATE.start_main_~y2~0_8 (* (- 1) v_ULTIMATE.start_main_~y1~0_8)))) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_8, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_8} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_8, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y2~0] 289#L20-2 [47] L20-2-->L20: Formula: (> v_ULTIMATE.start_main_~y1~0_12 v_ULTIMATE.start_main_~y2~0_12) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} AuxVars[] AssignedVars[] 287#L20 20.04/9.90 [2019-03-28 22:35:51,273 INFO L796 eck$LassoCheckResult]: Loop: 287#L20 [39] L20-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~y2~0_1 v_ULTIMATE.start_main_~y1~0_2) (= v_ULTIMATE.start_main_~y1~0_1 (+ (* (- 1) v_ULTIMATE.start_main_~y2~0_1) v_ULTIMATE.start_main_~y1~0_2))) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_2, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_1} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_1, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~y1~0] 288#L20-2 [47] L20-2-->L20: Formula: (> v_ULTIMATE.start_main_~y1~0_12 v_ULTIMATE.start_main_~y2~0_12) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} AuxVars[] AssignedVars[] 287#L20 20.04/9.90 [2019-03-28 22:35:51,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:51,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2458657, now seen corresponding path program 1 times 20.04/9.90 [2019-03-28 22:35:51,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.90 [2019-03-28 22:35:51,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.90 [2019-03-28 22:35:51,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:51,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:51,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:51,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.90 [2019-03-28 22:35:51,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2217, now seen corresponding path program 2 times 20.04/9.90 [2019-03-28 22:35:51,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.90 [2019-03-28 22:35:51,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.90 [2019-03-28 22:35:51,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:51,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:51,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.90 [2019-03-28 22:35:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.90 [2019-03-28 22:35:51,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.91 [2019-03-28 22:35:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1932196663, now seen corresponding path program 2 times 20.04/9.91 [2019-03-28 22:35:51,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.91 [2019-03-28 22:35:51,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.91 [2019-03-28 22:35:51,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.91 [2019-03-28 22:35:51,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.04/9.91 [2019-03-28 22:35:51,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.91 [2019-03-28 22:35:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.91 [2019-03-28 22:35:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.91 [2019-03-28 22:35:51,334 INFO L216 LassoAnalysis]: Preferences: 20.04/9.91 [2019-03-28 22:35:51,334 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.04/9.91 [2019-03-28 22:35:51,335 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.04/9.91 [2019-03-28 22:35:51,335 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.04/9.91 [2019-03-28 22:35:51,335 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.04/9.91 [2019-03-28 22:35:51,335 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.91 [2019-03-28 22:35:51,335 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.04/9.91 [2019-03-28 22:35:51,335 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.04/9.91 [2019-03-28 22:35:51,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 20.04/9.91 [2019-03-28 22:35:51,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.04/9.91 [2019-03-28 22:35:51,336 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.04/9.91 [2019-03-28 22:35:51,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:51,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:51,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:51,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:51,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:51,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:51,397 INFO L300 LassoAnalysis]: Preprocessing complete. 20.04/9.91 [2019-03-28 22:35:51,398 INFO L412 LassoAnalysis]: Checking for nontermination... 20.04/9.91 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.91 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.91 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.91 [2019-03-28 22:35:51,401 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.04/9.91 [2019-03-28 22:35:51,401 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.91 [2019-03-28 22:35:51,404 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.04/9.91 [2019-03-28 22:35:51,404 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.04/9.91 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.91 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.91 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.91 [2019-03-28 22:35:51,431 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.04/9.91 [2019-03-28 22:35:51,431 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.91 [2019-03-28 22:35:51,434 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.04/9.91 [2019-03-28 22:35:51,434 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.04/9.91 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.91 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.91 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.91 [2019-03-28 22:35:51,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.04/9.91 [2019-03-28 22:35:51,460 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.91 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.91 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.91 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.91 [2019-03-28 22:35:51,491 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.04/9.91 [2019-03-28 22:35:51,492 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.91 [2019-03-28 22:35:51,779 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.04/9.91 [2019-03-28 22:35:51,781 INFO L216 LassoAnalysis]: Preferences: 20.04/9.91 [2019-03-28 22:35:51,782 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.04/9.91 [2019-03-28 22:35:51,782 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.04/9.91 [2019-03-28 22:35:51,782 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.04/9.91 [2019-03-28 22:35:51,782 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.04/9.91 [2019-03-28 22:35:51,782 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.04/9.91 [2019-03-28 22:35:51,782 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.04/9.91 [2019-03-28 22:35:51,782 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.04/9.91 [2019-03-28 22:35:51,782 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 20.04/9.91 [2019-03-28 22:35:51,783 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.04/9.91 [2019-03-28 22:35:51,783 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.04/9.91 [2019-03-28 22:35:51,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:51,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:51,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:51,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:51,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:51,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:51,845 INFO L300 LassoAnalysis]: Preprocessing complete. 20.04/9.91 [2019-03-28 22:35:51,845 INFO L497 LassoAnalysis]: Using template 'affine'. 20.04/9.91 [2019-03-28 22:35:51,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.04/9.91 Termination analysis: LINEAR_WITH_GUESSES 20.04/9.91 Number of strict supporting invariants: 0 20.04/9.91 Number of non-strict supporting invariants: 1 20.04/9.91 Consider only non-deceasing supporting invariants: true 20.04/9.91 Simplify termination arguments: true 20.04/9.91 Simplify supporting invariants: trueOverapproximate stem: false 20.04/9.91 [2019-03-28 22:35:51,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.04/9.91 [2019-03-28 22:35:51,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.04/9.91 [2019-03-28 22:35:51,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.04/9.91 [2019-03-28 22:35:51,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.04/9.91 [2019-03-28 22:35:51,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.04/9.91 [2019-03-28 22:35:51,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.04/9.91 [2019-03-28 22:35:51,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.04/9.91 [2019-03-28 22:35:51,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.04/9.91 [2019-03-28 22:35:51,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.04/9.91 Termination analysis: LINEAR_WITH_GUESSES 20.04/9.91 Number of strict supporting invariants: 0 20.04/9.91 Number of non-strict supporting invariants: 1 20.04/9.91 Consider only non-deceasing supporting invariants: true 20.04/9.91 Simplify termination arguments: true 20.04/9.91 Simplify supporting invariants: trueOverapproximate stem: false 20.04/9.91 [2019-03-28 22:35:51,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.04/9.91 [2019-03-28 22:35:51,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.04/9.91 [2019-03-28 22:35:51,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.04/9.91 [2019-03-28 22:35:51,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.04/9.91 [2019-03-28 22:35:51,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.04/9.91 [2019-03-28 22:35:51,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.04/9.91 [2019-03-28 22:35:51,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.04/9.91 [2019-03-28 22:35:51,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.04/9.91 [2019-03-28 22:35:51,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.04/9.91 Termination analysis: LINEAR_WITH_GUESSES 20.04/9.91 Number of strict supporting invariants: 0 20.04/9.91 Number of non-strict supporting invariants: 1 20.04/9.91 Consider only non-deceasing supporting invariants: true 20.04/9.91 Simplify termination arguments: true 20.04/9.91 Simplify supporting invariants: trueOverapproximate stem: false 20.04/9.91 [2019-03-28 22:35:51,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.04/9.91 [2019-03-28 22:35:51,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.04/9.91 [2019-03-28 22:35:51,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.04/9.91 [2019-03-28 22:35:51,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.04/9.91 [2019-03-28 22:35:51,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.04/9.91 [2019-03-28 22:35:51,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.04/9.91 [2019-03-28 22:35:51,869 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.04/9.91 [2019-03-28 22:35:51,877 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 20.04/9.91 [2019-03-28 22:35:51,878 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. 20.04/9.91 [2019-03-28 22:35:51,878 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.04/9.91 [2019-03-28 22:35:51,879 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 20.04/9.91 [2019-03-28 22:35:51,880 INFO L518 LassoAnalysis]: Proved termination. 20.04/9.91 [2019-03-28 22:35:51,880 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.04/9.91 Ranking function f(ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_~y2~0) = 1*ULTIMATE.start_main_~y1~0 - 1*ULTIMATE.start_main_~y2~0 20.04/9.91 Supporting invariants [1*ULTIMATE.start_main_~y2~0 - 1 >= 0] 20.04/9.91 [2019-03-28 22:35:51,893 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed 20.04/9.91 [2019-03-28 22:35:51,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.91 [2019-03-28 22:35:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.04/9.91 [2019-03-28 22:35:51,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 20.04/9.91 [2019-03-28 22:35:51,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.04/9.91 [2019-03-28 22:35:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.04/9.91 [2019-03-28 22:35:51,953 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core 20.04/9.91 [2019-03-28 22:35:51,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.04/9.91 [2019-03-28 22:35:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.04/9.91 [2019-03-28 22:35:52,000 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.04/9.91 [2019-03-28 22:35:52,000 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates 20.04/9.91 [2019-03-28 22:35:52,000 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 5 states. 20.04/9.91 [2019-03-28 22:35:52,061 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 16 states and 20 transitions. Complement of second has 8 states. 20.04/9.91 [2019-03-28 22:35:52,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states 20.04/9.91 [2019-03-28 22:35:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 20.04/9.91 [2019-03-28 22:35:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. 20.04/9.91 [2019-03-28 22:35:52,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 2 letters. 20.04/9.91 [2019-03-28 22:35:52,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.91 [2019-03-28 22:35:52,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 2 letters. 20.04/9.91 [2019-03-28 22:35:52,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.91 [2019-03-28 22:35:52,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. 20.04/9.91 [2019-03-28 22:35:52,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.91 [2019-03-28 22:35:52,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. 20.04/9.91 [2019-03-28 22:35:52,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 20.04/9.91 [2019-03-28 22:35:52,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. 20.04/9.91 [2019-03-28 22:35:52,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 20.04/9.91 [2019-03-28 22:35:52,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 20.04/9.91 [2019-03-28 22:35:52,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. 20.04/9.91 [2019-03-28 22:35:52,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.04/9.91 [2019-03-28 22:35:52,067 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. 20.04/9.91 [2019-03-28 22:35:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. 20.04/9.91 [2019-03-28 22:35:52,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. 20.04/9.91 [2019-03-28 22:35:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 20.04/9.91 [2019-03-28 22:35:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. 20.04/9.91 [2019-03-28 22:35:52,068 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. 20.04/9.91 [2019-03-28 22:35:52,068 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. 20.04/9.91 [2019-03-28 22:35:52,068 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 20.04/9.91 [2019-03-28 22:35:52,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. 20.04/9.91 [2019-03-28 22:35:52,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 20.04/9.91 [2019-03-28 22:35:52,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.04/9.91 [2019-03-28 22:35:52,069 INFO L119 BuchiIsEmpty]: Starting construction of run 20.04/9.91 [2019-03-28 22:35:52,069 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 20.04/9.91 [2019-03-28 22:35:52,069 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 20.04/9.91 [2019-03-28 22:35:52,070 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY [50] ULTIMATE.startENTRY-->L20-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_13) (< 0 v_ULTIMATE.start_main_~y2~0_13)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 365#L20-2 [46] L20-2-->L20: Formula: (< v_ULTIMATE.start_main_~y1~0_12 v_ULTIMATE.start_main_~y2~0_12) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} AuxVars[] AssignedVars[] 366#L20 [43] L20-->L20-2: Formula: (and (>= v_ULTIMATE.start_main_~y2~0_8 v_ULTIMATE.start_main_~y1~0_8) (= v_ULTIMATE.start_main_~y2~0_7 (+ v_ULTIMATE.start_main_~y2~0_8 (* (- 1) v_ULTIMATE.start_main_~y1~0_8)))) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_8, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_8} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_8, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y2~0] 370#L20-2 [47] L20-2-->L20: Formula: (> v_ULTIMATE.start_main_~y1~0_12 v_ULTIMATE.start_main_~y2~0_12) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} AuxVars[] AssignedVars[] 369#L20 20.04/9.91 [2019-03-28 22:35:52,070 INFO L796 eck$LassoCheckResult]: Loop: 369#L20 [39] L20-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~y2~0_1 v_ULTIMATE.start_main_~y1~0_2) (= v_ULTIMATE.start_main_~y1~0_1 (+ (* (- 1) v_ULTIMATE.start_main_~y2~0_1) v_ULTIMATE.start_main_~y1~0_2))) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_2, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_1} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_1, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~y1~0] 368#L20-2 [46] L20-2-->L20: Formula: (< v_ULTIMATE.start_main_~y1~0_12 v_ULTIMATE.start_main_~y2~0_12) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} AuxVars[] AssignedVars[] 366#L20 [43] L20-->L20-2: Formula: (and (>= v_ULTIMATE.start_main_~y2~0_8 v_ULTIMATE.start_main_~y1~0_8) (= v_ULTIMATE.start_main_~y2~0_7 (+ v_ULTIMATE.start_main_~y2~0_8 (* (- 1) v_ULTIMATE.start_main_~y1~0_8)))) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_8, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_8} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_8, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y2~0] 370#L20-2 [47] L20-2-->L20: Formula: (> v_ULTIMATE.start_main_~y1~0_12 v_ULTIMATE.start_main_~y2~0_12) InVars {ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} OutVars{ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_12, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_12} AuxVars[] AssignedVars[] 369#L20 20.04/9.91 [2019-03-28 22:35:52,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.91 [2019-03-28 22:35:52,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2458657, now seen corresponding path program 2 times 20.04/9.91 [2019-03-28 22:35:52,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.91 [2019-03-28 22:35:52,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.91 [2019-03-28 22:35:52,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.91 [2019-03-28 22:35:52,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.04/9.91 [2019-03-28 22:35:52,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.91 [2019-03-28 22:35:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.91 [2019-03-28 22:35:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.91 [2019-03-28 22:35:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.91 [2019-03-28 22:35:52,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2130956, now seen corresponding path program 1 times 20.04/9.91 [2019-03-28 22:35:52,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.91 [2019-03-28 22:35:52,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.91 [2019-03-28 22:35:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.91 [2019-03-28 22:35:52,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.04/9.91 [2019-03-28 22:35:52,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.91 [2019-03-28 22:35:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.91 [2019-03-28 22:35:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.91 [2019-03-28 22:35:52,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.91 [2019-03-28 22:35:52,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1415120852, now seen corresponding path program 3 times 20.04/9.91 [2019-03-28 22:35:52,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.04/9.91 [2019-03-28 22:35:52,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.04/9.91 [2019-03-28 22:35:52,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.91 [2019-03-28 22:35:52,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.04/9.91 [2019-03-28 22:35:52,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.04/9.91 [2019-03-28 22:35:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.91 [2019-03-28 22:35:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.04/9.91 [2019-03-28 22:35:52,120 INFO L216 LassoAnalysis]: Preferences: 20.04/9.91 [2019-03-28 22:35:52,120 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.04/9.91 [2019-03-28 22:35:52,121 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.04/9.91 [2019-03-28 22:35:52,121 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.04/9.91 [2019-03-28 22:35:52,121 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.04/9.91 [2019-03-28 22:35:52,121 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.91 [2019-03-28 22:35:52,121 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.04/9.91 [2019-03-28 22:35:52,121 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.04/9.91 [2019-03-28 22:35:52,121 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 20.04/9.91 [2019-03-28 22:35:52,121 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.04/9.91 [2019-03-28 22:35:52,121 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.04/9.91 [2019-03-28 22:35:52,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:52,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:52,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:52,169 INFO L300 LassoAnalysis]: Preprocessing complete. 20.04/9.91 [2019-03-28 22:35:52,169 INFO L412 LassoAnalysis]: Checking for nontermination... 20.04/9.91 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.91 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.91 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.91 [2019-03-28 22:35:52,172 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.04/9.91 [2019-03-28 22:35:52,172 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.91 [2019-03-28 22:35:52,200 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.04/9.91 [2019-03-28 22:35:52,200 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.04/9.91 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.91 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.91 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.91 [2019-03-28 22:35:52,204 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.04/9.91 [2019-03-28 22:35:52,204 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.91 [2019-03-28 22:35:52,232 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.04/9.91 [2019-03-28 22:35:52,232 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.04/9.91 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.91 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.91 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.91 [2019-03-28 22:35:52,236 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.04/9.91 [2019-03-28 22:35:52,236 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.91 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.04/9.91 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.04/9.91 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.04/9.91 [2019-03-28 22:35:52,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.04/9.91 [2019-03-28 22:35:52,266 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.04/9.91 [2019-03-28 22:35:52,784 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.04/9.91 [2019-03-28 22:35:52,787 INFO L216 LassoAnalysis]: Preferences: 20.04/9.91 [2019-03-28 22:35:52,787 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.04/9.91 [2019-03-28 22:35:52,787 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.04/9.91 [2019-03-28 22:35:52,787 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.04/9.91 [2019-03-28 22:35:52,787 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.04/9.91 [2019-03-28 22:35:52,787 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.04/9.91 [2019-03-28 22:35:52,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.04/9.91 [2019-03-28 22:35:52,788 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.04/9.91 [2019-03-28 22:35:52,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 20.04/9.91 [2019-03-28 22:35:52,788 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.04/9.91 [2019-03-28 22:35:52,788 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.04/9.91 [2019-03-28 22:35:52,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:52,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:52,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.04/9.91 [2019-03-28 22:35:52,843 INFO L300 LassoAnalysis]: Preprocessing complete. 20.04/9.91 [2019-03-28 22:35:52,843 INFO L497 LassoAnalysis]: Using template 'affine'. 20.04/9.91 [2019-03-28 22:35:52,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.04/9.91 Termination analysis: LINEAR_WITH_GUESSES 20.04/9.91 Number of strict supporting invariants: 0 20.04/9.91 Number of non-strict supporting invariants: 1 20.04/9.91 Consider only non-deceasing supporting invariants: true 20.04/9.91 Simplify termination arguments: true 20.04/9.91 Simplify supporting invariants: trueOverapproximate stem: false 20.04/9.91 [2019-03-28 22:35:52,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.04/9.91 [2019-03-28 22:35:52,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.04/9.91 [2019-03-28 22:35:52,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.04/9.91 [2019-03-28 22:35:52,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.04/9.91 [2019-03-28 22:35:52,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.04/9.91 [2019-03-28 22:35:52,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.04/9.91 [2019-03-28 22:35:52,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.04/9.91 [2019-03-28 22:35:52,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.04/9.91 Termination analysis: LINEAR_WITH_GUESSES 20.04/9.91 Number of strict supporting invariants: 0 20.04/9.91 Number of non-strict supporting invariants: 1 20.04/9.91 Consider only non-deceasing supporting invariants: true 20.04/9.91 Simplify termination arguments: true 20.04/9.91 Simplify supporting invariants: trueOverapproximate stem: false 20.04/9.91 [2019-03-28 22:35:52,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.04/9.91 [2019-03-28 22:35:52,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.04/9.91 [2019-03-28 22:35:52,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.04/9.91 [2019-03-28 22:35:52,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.04/9.91 [2019-03-28 22:35:52,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.04/9.91 [2019-03-28 22:35:52,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.04/9.91 [2019-03-28 22:35:52,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.04/9.91 [2019-03-28 22:35:52,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.04/9.91 Termination analysis: LINEAR_WITH_GUESSES 20.04/9.91 Number of strict supporting invariants: 0 20.04/9.91 Number of non-strict supporting invariants: 1 20.04/9.91 Consider only non-deceasing supporting invariants: true 20.04/9.91 Simplify termination arguments: true 20.04/9.91 Simplify supporting invariants: trueOverapproximate stem: false 20.04/9.91 [2019-03-28 22:35:52,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.04/9.91 [2019-03-28 22:35:52,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.04/9.91 [2019-03-28 22:35:52,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.04/9.91 [2019-03-28 22:35:52,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.04/9.91 [2019-03-28 22:35:52,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.04/9.91 [2019-03-28 22:35:52,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.04/9.91 [2019-03-28 22:35:52,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.04/9.91 [2019-03-28 22:35:52,859 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.04/9.91 [2019-03-28 22:35:52,862 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.04/9.91 [2019-03-28 22:35:52,862 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. 20.04/9.91 [2019-03-28 22:35:52,863 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.04/9.91 [2019-03-28 22:35:52,863 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.04/9.91 [2019-03-28 22:35:52,863 INFO L518 LassoAnalysis]: Proved termination. 20.04/9.91 [2019-03-28 22:35:52,863 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.04/9.91 Ranking function f(ULTIMATE.start_main_~y1~0) = 1*ULTIMATE.start_main_~y1~0 20.04/9.91 Supporting invariants [] 20.04/9.91 [2019-03-28 22:35:52,863 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.04/9.91 [2019-03-28 22:35:52,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.04/9.91 [2019-03-28 22:35:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.04/9.91 [2019-03-28 22:35:52,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core 20.04/9.91 [2019-03-28 22:35:52,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.04/9.91 [2019-03-28 22:35:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.04/9.91 [2019-03-28 22:35:52,884 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core 20.04/9.91 [2019-03-28 22:35:52,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.04/9.91 [2019-03-28 22:35:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.04/9.91 [2019-03-28 22:35:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.04/9.91 [2019-03-28 22:35:52,922 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core 20.04/9.91 [2019-03-28 22:35:52,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.04/9.91 [2019-03-28 22:35:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.04/9.91 [2019-03-28 22:35:52,984 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core 20.04/9.91 [2019-03-28 22:35:52,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.04/9.91 [2019-03-28 22:35:52,990 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 7 predicates after loop cannibalization 20.04/9.91 [2019-03-28 22:35:52,990 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates 20.04/9.91 [2019-03-28 22:35:52,990 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 4 Second operand 4 states. 20.04/9.91 [2019-03-28 22:35:53,265 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 61 states and 87 transitions. Complement of second has 43 states. 20.04/9.91 [2019-03-28 22:35:53,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 2 accepting loop states 20.04/9.91 [2019-03-28 22:35:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.04/9.91 [2019-03-28 22:35:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. 20.04/9.91 [2019-03-28 22:35:53,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 21 transitions. Stem has 4 letters. Loop has 4 letters. 20.04/9.91 [2019-03-28 22:35:53,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.91 [2019-03-28 22:35:53,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 21 transitions. Stem has 8 letters. Loop has 4 letters. 20.04/9.91 [2019-03-28 22:35:53,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.91 [2019-03-28 22:35:53,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 21 transitions. Stem has 4 letters. Loop has 8 letters. 20.04/9.91 [2019-03-28 22:35:53,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.04/9.91 [2019-03-28 22:35:53,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. 20.04/9.91 [2019-03-28 22:35:53,271 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.04/9.91 [2019-03-28 22:35:53,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 0 states and 0 transitions. 20.04/9.91 [2019-03-28 22:35:53,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 20.04/9.91 [2019-03-28 22:35:53,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 20.04/9.91 [2019-03-28 22:35:53,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 20.04/9.91 [2019-03-28 22:35:53,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.04/9.91 [2019-03-28 22:35:53,272 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.04/9.91 [2019-03-28 22:35:53,272 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.04/9.91 [2019-03-28 22:35:53,272 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.04/9.91 [2019-03-28 22:35:53,272 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 20.04/9.91 [2019-03-28 22:35:53,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 20.04/9.91 [2019-03-28 22:35:53,272 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.04/9.91 [2019-03-28 22:35:53,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 20.04/9.91 [2019-03-28 22:35:53,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:35:53 BasicIcfg 20.04/9.91 [2019-03-28 22:35:53,278 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 20.04/9.91 [2019-03-28 22:35:53,279 INFO L168 Benchmark]: Toolchain (without parser) took 5335.29 ms. Allocated memory was 649.6 MB in the beginning and 756.0 MB in the end (delta: 106.4 MB). Free memory was 564.9 MB in the beginning and 452.8 MB in the end (delta: 112.1 MB). Peak memory consumption was 218.5 MB. Max. memory is 50.3 GB. 20.04/9.91 [2019-03-28 22:35:53,280 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 586.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.04/9.91 [2019-03-28 22:35:53,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.52 ms. Allocated memory is still 649.6 MB. Free memory was 564.9 MB in the beginning and 555.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 20.04/9.91 [2019-03-28 22:35:53,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.34 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 555.5 MB in the beginning and 649.9 MB in the end (delta: -94.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 50.3 GB. 20.04/9.91 [2019-03-28 22:35:53,282 INFO L168 Benchmark]: Boogie Preprocessor took 19.90 ms. Allocated memory is still 683.7 MB. Free memory was 649.9 MB in the beginning and 648.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. 20.04/9.91 [2019-03-28 22:35:53,282 INFO L168 Benchmark]: RCFGBuilder took 206.24 ms. Allocated memory is still 683.7 MB. Free memory was 648.1 MB in the beginning and 633.9 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 20.04/9.91 [2019-03-28 22:35:53,283 INFO L168 Benchmark]: BlockEncodingV2 took 82.81 ms. Allocated memory is still 683.7 MB. Free memory was 633.9 MB in the beginning and 628.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 20.04/9.91 [2019-03-28 22:35:53,283 INFO L168 Benchmark]: TraceAbstraction took 153.57 ms. Allocated memory is still 683.7 MB. Free memory was 628.5 MB in the beginning and 619.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 20.04/9.91 [2019-03-28 22:35:53,284 INFO L168 Benchmark]: BuchiAutomizer took 4547.75 ms. Allocated memory was 683.7 MB in the beginning and 756.0 MB in the end (delta: 72.4 MB). Free memory was 619.1 MB in the beginning and 452.8 MB in the end (delta: 166.2 MB). Peak memory consumption was 238.6 MB. Max. memory is 50.3 GB. 20.04/9.91 [2019-03-28 22:35:53,288 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 20.04/9.91 --- Results --- 20.04/9.91 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 20.04/9.91 - StatisticsResult: Initial Icfg 20.04/9.91 8 locations, 11 edges 20.04/9.91 - StatisticsResult: Encoded RCFG 20.04/9.91 3 locations, 5 edges 20.04/9.91 * Results from de.uni_freiburg.informatik.ultimate.core: 20.04/9.91 - StatisticsResult: Toolchain Benchmarks 20.04/9.91 Benchmark results are: 20.04/9.91 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 586.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.04/9.91 * CACSL2BoogieTranslator took 229.52 ms. Allocated memory is still 649.6 MB. Free memory was 564.9 MB in the beginning and 555.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 20.04/9.91 * Boogie Procedure Inliner took 90.34 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 555.5 MB in the beginning and 649.9 MB in the end (delta: -94.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 50.3 GB. 20.04/9.91 * Boogie Preprocessor took 19.90 ms. Allocated memory is still 683.7 MB. Free memory was 649.9 MB in the beginning and 648.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. 20.04/9.91 * RCFGBuilder took 206.24 ms. Allocated memory is still 683.7 MB. Free memory was 648.1 MB in the beginning and 633.9 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 20.04/9.91 * BlockEncodingV2 took 82.81 ms. Allocated memory is still 683.7 MB. Free memory was 633.9 MB in the beginning and 628.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 20.04/9.91 * TraceAbstraction took 153.57 ms. Allocated memory is still 683.7 MB. Free memory was 628.5 MB in the beginning and 619.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 20.04/9.91 * BuchiAutomizer took 4547.75 ms. Allocated memory was 683.7 MB in the beginning and 756.0 MB in the end (delta: 72.4 MB). Free memory was 619.1 MB in the beginning and 452.8 MB in the end (delta: 166.2 MB). Peak memory consumption was 238.6 MB. Max. memory is 50.3 GB. 20.04/9.91 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 20.04/9.91 - AllSpecificationsHoldResult: All specifications hold 20.04/9.91 We were not able to verify any specifiation because the program does not contain any specification. 20.04/9.91 - InvariantResult [Line: 19]: Loop Invariant 20.04/9.91 Derived loop invariant: 1 20.04/9.91 - StatisticsResult: Ultimate Automizer benchmark data 20.04/9.91 CFG has 1 procedures, 3 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 20.04/9.91 - StatisticsResult: Constructed decomposition of program 20.04/9.91 Your program was decomposed into 6 terminating modules (1 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function -1 * y1 + y2 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * y1 + y2 and consists of 6 locations. One nondeterministic module has affine ranking function 2 * y1 + 1 and consists of 6 locations. One nondeterministic module has affine ranking function y1 + -1 * y2 and consists of 5 locations. One nondeterministic module has affine ranking function y1 and consists of 11 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. 20.04/9.91 - StatisticsResult: Timing statistics 20.04/9.91 BüchiAutomizer plugin needed 4.5s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 2. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 10 SDtfs, 64 SDslu, 0 SDs, 0 SdLazy, 137 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax162 hnf92 lsp58 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq142 hnf95 smp100 dnf100 smp100 tf101 neg100 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.6s 20.04/9.91 - TerminationAnalysisResult: Termination proven 20.04/9.91 Buchi Automizer proved that your program is terminating 20.04/9.91 RESULT: Ultimate proved your program to be correct! 20.04/9.91 !SESSION 2019-03-28 22:35:44.617 ----------------------------------------------- 20.04/9.91 eclipse.buildId=unknown 20.04/9.91 java.version=1.8.0_181 20.04/9.91 java.vendor=Oracle Corporation 20.04/9.91 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 20.04/9.91 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 20.04/9.91 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 20.04/9.91 20.04/9.91 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 22:35:53.522 20.04/9.91 !MESSAGE The workspace will exit with unsaved changes in this session. 20.04/9.91 Received shutdown request... 20.04/9.91 Ultimate: 20.04/9.91 GTK+ Version Check 20.04/9.91 EOF