24.23/11.37 YES 24.23/11.37 24.23/11.37 Ultimate: Cannot open display: 24.23/11.37 This is Ultimate 0.1.24-8dc7c08-m 24.23/11.37 [2019-03-28 22:41:00,610 INFO L170 SettingsManager]: Resetting all preferences to default values... 24.23/11.37 [2019-03-28 22:41:00,612 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 24.23/11.37 [2019-03-28 22:41:00,623 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 24.23/11.37 [2019-03-28 22:41:00,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 24.23/11.37 [2019-03-28 22:41:00,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 24.23/11.37 [2019-03-28 22:41:00,626 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 24.23/11.37 [2019-03-28 22:41:00,627 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 24.23/11.37 [2019-03-28 22:41:00,629 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 24.23/11.37 [2019-03-28 22:41:00,629 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 24.23/11.37 [2019-03-28 22:41:00,630 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 24.23/11.37 [2019-03-28 22:41:00,630 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 24.23/11.37 [2019-03-28 22:41:00,631 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 24.23/11.37 [2019-03-28 22:41:00,632 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 24.23/11.37 [2019-03-28 22:41:00,633 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 24.23/11.37 [2019-03-28 22:41:00,634 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 24.23/11.37 [2019-03-28 22:41:00,635 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 24.23/11.37 [2019-03-28 22:41:00,636 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 24.23/11.37 [2019-03-28 22:41:00,638 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 24.23/11.37 [2019-03-28 22:41:00,640 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 24.23/11.37 [2019-03-28 22:41:00,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 24.23/11.37 [2019-03-28 22:41:00,642 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 24.23/11.37 [2019-03-28 22:41:00,644 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 24.23/11.37 [2019-03-28 22:41:00,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 24.23/11.37 [2019-03-28 22:41:00,644 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 24.23/11.37 [2019-03-28 22:41:00,645 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 24.23/11.37 [2019-03-28 22:41:00,645 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 24.23/11.37 [2019-03-28 22:41:00,646 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 24.23/11.37 [2019-03-28 22:41:00,647 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 24.23/11.37 [2019-03-28 22:41:00,647 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 24.23/11.37 [2019-03-28 22:41:00,648 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 24.23/11.37 [2019-03-28 22:41:00,649 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 24.23/11.37 [2019-03-28 22:41:00,650 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 24.23/11.37 [2019-03-28 22:41:00,650 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 24.23/11.37 [2019-03-28 22:41:00,650 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 24.23/11.37 [2019-03-28 22:41:00,651 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 24.23/11.37 [2019-03-28 22:41:00,651 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 24.23/11.37 [2019-03-28 22:41:00,652 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 24.23/11.37 [2019-03-28 22:41:00,652 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 24.23/11.37 [2019-03-28 22:41:00,653 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 24.23/11.37 [2019-03-28 22:41:00,667 INFO L110 SettingsManager]: Loading preferences was successful 24.23/11.37 [2019-03-28 22:41:00,668 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 24.23/11.37 [2019-03-28 22:41:00,669 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 24.23/11.37 [2019-03-28 22:41:00,669 INFO L133 SettingsManager]: * Rewrite not-equals=true 24.23/11.37 [2019-03-28 22:41:00,669 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 24.23/11.37 [2019-03-28 22:41:00,669 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 24.23/11.37 [2019-03-28 22:41:00,670 INFO L133 SettingsManager]: * Use SBE=true 24.23/11.37 [2019-03-28 22:41:00,670 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 24.23/11.37 [2019-03-28 22:41:00,670 INFO L133 SettingsManager]: * Use old map elimination=false 24.23/11.37 [2019-03-28 22:41:00,670 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 24.23/11.37 [2019-03-28 22:41:00,670 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 24.23/11.37 [2019-03-28 22:41:00,670 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 24.23/11.37 [2019-03-28 22:41:00,671 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 24.23/11.37 [2019-03-28 22:41:00,671 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 24.23/11.37 [2019-03-28 22:41:00,671 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.37 [2019-03-28 22:41:00,671 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 24.23/11.37 [2019-03-28 22:41:00,671 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 24.23/11.37 [2019-03-28 22:41:00,671 INFO L133 SettingsManager]: * Check division by zero=IGNORE 24.23/11.37 [2019-03-28 22:41:00,672 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 24.23/11.37 [2019-03-28 22:41:00,672 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 24.23/11.37 [2019-03-28 22:41:00,672 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 24.23/11.37 [2019-03-28 22:41:00,672 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 24.23/11.37 [2019-03-28 22:41:00,672 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 24.23/11.37 [2019-03-28 22:41:00,673 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 24.23/11.37 [2019-03-28 22:41:00,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 24.23/11.37 [2019-03-28 22:41:00,673 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 24.23/11.37 [2019-03-28 22:41:00,673 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 24.23/11.37 [2019-03-28 22:41:00,673 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 24.23/11.37 [2019-03-28 22:41:00,673 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 24.23/11.37 [2019-03-28 22:41:00,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 24.23/11.37 [2019-03-28 22:41:00,712 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 24.23/11.37 [2019-03-28 22:41:00,715 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 24.23/11.37 [2019-03-28 22:41:00,717 INFO L271 PluginConnector]: Initializing CDTParser... 24.23/11.37 [2019-03-28 22:41:00,717 INFO L276 PluginConnector]: CDTParser initialized 24.23/11.37 [2019-03-28 22:41:00,718 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 24.23/11.37 [2019-03-28 22:41:00,781 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/6ae90b36a50d4096903e49a2400cc56e/FLAG60aed527c 24.23/11.37 [2019-03-28 22:41:01,119 INFO L307 CDTParser]: Found 1 translation units. 24.23/11.37 [2019-03-28 22:41:01,120 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 24.23/11.37 [2019-03-28 22:41:01,127 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/6ae90b36a50d4096903e49a2400cc56e/FLAG60aed527c 24.23/11.37 [2019-03-28 22:41:01,527 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/6ae90b36a50d4096903e49a2400cc56e 24.23/11.37 [2019-03-28 22:41:01,538 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 24.23/11.37 [2019-03-28 22:41:01,540 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 24.23/11.37 [2019-03-28 22:41:01,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 24.23/11.37 [2019-03-28 22:41:01,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 24.23/11.37 [2019-03-28 22:41:01,545 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 24.23/11.37 [2019-03-28 22:41:01,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:41:01" (1/1) ... 24.23/11.37 [2019-03-28 22:41:01,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44791d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:41:01, skipping insertion in model container 24.23/11.37 [2019-03-28 22:41:01,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:41:01" (1/1) ... 24.23/11.37 [2019-03-28 22:41:01,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 24.23/11.37 [2019-03-28 22:41:01,574 INFO L176 MainTranslator]: Built tables and reachable declarations 24.23/11.37 [2019-03-28 22:41:01,740 INFO L206 PostProcessor]: Analyzing one entry point: main 24.23/11.37 [2019-03-28 22:41:01,745 INFO L191 MainTranslator]: Completed pre-run 24.23/11.37 [2019-03-28 22:41:01,763 INFO L206 PostProcessor]: Analyzing one entry point: main 24.23/11.37 [2019-03-28 22:41:01,778 INFO L195 MainTranslator]: Completed translation 24.23/11.37 [2019-03-28 22:41:01,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:41:01 WrapperNode 24.23/11.37 [2019-03-28 22:41:01,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 24.23/11.37 [2019-03-28 22:41:01,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 24.23/11.37 [2019-03-28 22:41:01,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 24.23/11.37 [2019-03-28 22:41:01,780 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 24.23/11.37 [2019-03-28 22:41:01,849 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:41:01" (1/1) ... 24.23/11.37 [2019-03-28 22:41:01,855 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:41:01" (1/1) ... 24.23/11.37 [2019-03-28 22:41:01,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 24.23/11.37 [2019-03-28 22:41:01,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 24.23/11.37 [2019-03-28 22:41:01,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 24.23/11.37 [2019-03-28 22:41:01,877 INFO L276 PluginConnector]: Boogie Preprocessor initialized 24.23/11.37 [2019-03-28 22:41:01,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:41:01" (1/1) ... 24.23/11.37 [2019-03-28 22:41:01,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:41:01" (1/1) ... 24.23/11.37 [2019-03-28 22:41:01,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:41:01" (1/1) ... 24.23/11.37 [2019-03-28 22:41:01,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:41:01" (1/1) ... 24.23/11.37 [2019-03-28 22:41:01,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:41:01" (1/1) ... 24.23/11.37 [2019-03-28 22:41:01,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:41:01" (1/1) ... 24.23/11.37 [2019-03-28 22:41:01,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:41:01" (1/1) ... 24.23/11.37 [2019-03-28 22:41:01,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 24.23/11.37 [2019-03-28 22:41:01,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 24.23/11.37 [2019-03-28 22:41:01,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... 24.23/11.37 [2019-03-28 22:41:01,899 INFO L276 PluginConnector]: RCFGBuilder initialized 24.23/11.37 [2019-03-28 22:41:01,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:41:01" (1/1) ... 24.23/11.37 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.37 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 24.23/11.37 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 24.23/11.37 [2019-03-28 22:41:01,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 24.23/11.37 [2019-03-28 22:41:01,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 24.23/11.37 [2019-03-28 22:41:02,116 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 24.23/11.37 [2019-03-28 22:41:02,117 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 24.23/11.37 [2019-03-28 22:41:02,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:41:02 BoogieIcfgContainer 24.23/11.37 [2019-03-28 22:41:02,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 24.23/11.37 [2019-03-28 22:41:02,119 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 24.23/11.37 [2019-03-28 22:41:02,119 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 24.23/11.37 [2019-03-28 22:41:02,121 INFO L276 PluginConnector]: BlockEncodingV2 initialized 24.23/11.37 [2019-03-28 22:41:02,122 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:41:02" (1/1) ... 24.23/11.37 [2019-03-28 22:41:02,139 INFO L313 BlockEncoder]: Initial Icfg 11 locations, 15 edges 24.23/11.37 [2019-03-28 22:41:02,141 INFO L258 BlockEncoder]: Using Remove infeasible edges 24.23/11.37 [2019-03-28 22:41:02,142 INFO L263 BlockEncoder]: Using Maximize final states 24.23/11.37 [2019-03-28 22:41:02,143 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 24.23/11.37 [2019-03-28 22:41:02,143 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 24.23/11.37 [2019-03-28 22:41:02,145 INFO L296 BlockEncoder]: Using Remove sink states 24.23/11.37 [2019-03-28 22:41:02,146 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 24.23/11.37 [2019-03-28 22:41:02,146 INFO L179 BlockEncoder]: Using Rewrite not-equals 24.23/11.37 [2019-03-28 22:41:02,163 INFO L185 BlockEncoder]: Using Use SBE 24.23/11.37 [2019-03-28 22:41:02,180 INFO L200 BlockEncoder]: SBE split 2 edges 24.23/11.37 [2019-03-28 22:41:02,185 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 24.23/11.37 [2019-03-28 22:41:02,187 INFO L71 MaximizeFinalStates]: 0 new accepting states 24.23/11.37 [2019-03-28 22:41:02,198 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 24.23/11.37 [2019-03-28 22:41:02,200 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 24.23/11.37 [2019-03-28 22:41:02,202 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 24.23/11.37 [2019-03-28 22:41:02,202 INFO L71 MaximizeFinalStates]: 0 new accepting states 24.23/11.37 [2019-03-28 22:41:02,202 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 24.23/11.37 [2019-03-28 22:41:02,203 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 24.23/11.37 [2019-03-28 22:41:02,203 INFO L313 BlockEncoder]: Encoded RCFG 7 locations, 11 edges 24.23/11.37 [2019-03-28 22:41:02,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:41:02 BasicIcfg 24.23/11.37 [2019-03-28 22:41:02,204 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 24.23/11.37 [2019-03-28 22:41:02,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 24.23/11.37 [2019-03-28 22:41:02,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... 24.23/11.37 [2019-03-28 22:41:02,208 INFO L276 PluginConnector]: TraceAbstraction initialized 24.23/11.37 [2019-03-28 22:41:02,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 10:41:01" (1/4) ... 24.23/11.37 [2019-03-28 22:41:02,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69843a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:41:02, skipping insertion in model container 24.23/11.37 [2019-03-28 22:41:02,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:41:01" (2/4) ... 24.23/11.37 [2019-03-28 22:41:02,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69843a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:41:02, skipping insertion in model container 24.23/11.37 [2019-03-28 22:41:02,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:41:02" (3/4) ... 24.23/11.37 [2019-03-28 22:41:02,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69843a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:41:02, skipping insertion in model container 24.23/11.37 [2019-03-28 22:41:02,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:41:02" (4/4) ... 24.23/11.37 [2019-03-28 22:41:02,213 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 24.23/11.37 [2019-03-28 22:41:02,224 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 24.23/11.37 [2019-03-28 22:41:02,232 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 24.23/11.37 [2019-03-28 22:41:02,249 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 24.23/11.37 [2019-03-28 22:41:02,278 INFO L133 ementStrategyFactory]: Using default assertion order modulation 24.23/11.37 [2019-03-28 22:41:02,278 INFO L382 AbstractCegarLoop]: Interprodecural is true 24.23/11.37 [2019-03-28 22:41:02,279 INFO L383 AbstractCegarLoop]: Hoare is true 24.23/11.37 [2019-03-28 22:41:02,279 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 24.23/11.37 [2019-03-28 22:41:02,279 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 24.23/11.37 [2019-03-28 22:41:02,279 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 24.23/11.37 [2019-03-28 22:41:02,279 INFO L387 AbstractCegarLoop]: Difference is false 24.23/11.37 [2019-03-28 22:41:02,279 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 24.23/11.37 [2019-03-28 22:41:02,280 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 24.23/11.37 [2019-03-28 22:41:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. 24.23/11.37 [2019-03-28 22:41:02,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 24.23/11.37 [2019-03-28 22:41:02,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. 24.23/11.37 [2019-03-28 22:41:02,353 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 37) no Hoare annotation was computed. 24.23/11.37 [2019-03-28 22:41:02,353 INFO L448 ceAbstractionStarter]: For program point L33-2(lines 33 37) no Hoare annotation was computed. 24.23/11.37 [2019-03-28 22:41:02,353 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 24.23/11.37 [2019-03-28 22:41:02,354 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. 24.23/11.37 [2019-03-28 22:41:02,354 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 39) no Hoare annotation was computed. 24.23/11.37 [2019-03-28 22:41:02,354 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 26 30) no Hoare annotation was computed. 24.23/11.37 [2019-03-28 22:41:02,354 INFO L451 ceAbstractionStarter]: At program point L25-2(lines 24 40) the Hoare annotation is: true 24.23/11.37 [2019-03-28 22:41:02,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:41:02 BasicIcfg 24.23/11.37 [2019-03-28 22:41:02,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 24.23/11.37 [2019-03-28 22:41:02,363 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 24.23/11.37 [2019-03-28 22:41:02,363 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 24.23/11.37 [2019-03-28 22:41:02,366 INFO L276 PluginConnector]: BuchiAutomizer initialized 24.23/11.37 [2019-03-28 22:41:02,367 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.23/11.37 [2019-03-28 22:41:02,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 10:41:01" (1/5) ... 24.23/11.37 [2019-03-28 22:41:02,368 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fecfc3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:41:02, skipping insertion in model container 24.23/11.37 [2019-03-28 22:41:02,368 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.23/11.37 [2019-03-28 22:41:02,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:41:01" (2/5) ... 24.23/11.37 [2019-03-28 22:41:02,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fecfc3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:41:02, skipping insertion in model container 24.23/11.37 [2019-03-28 22:41:02,369 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.23/11.37 [2019-03-28 22:41:02,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:41:02" (3/5) ... 24.23/11.37 [2019-03-28 22:41:02,370 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fecfc3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:41:02, skipping insertion in model container 24.23/11.37 [2019-03-28 22:41:02,370 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.23/11.37 [2019-03-28 22:41:02,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:41:02" (4/5) ... 24.23/11.37 [2019-03-28 22:41:02,370 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fecfc3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:41:02, skipping insertion in model container 24.23/11.37 [2019-03-28 22:41:02,370 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.23/11.37 [2019-03-28 22:41:02,371 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:41:02" (5/5) ... 24.23/11.37 [2019-03-28 22:41:02,372 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 24.23/11.37 [2019-03-28 22:41:02,398 INFO L133 ementStrategyFactory]: Using default assertion order modulation 24.23/11.37 [2019-03-28 22:41:02,398 INFO L374 BuchiCegarLoop]: Interprodecural is true 24.23/11.37 [2019-03-28 22:41:02,398 INFO L375 BuchiCegarLoop]: Hoare is true 24.23/11.37 [2019-03-28 22:41:02,399 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 24.23/11.37 [2019-03-28 22:41:02,399 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 24.23/11.37 [2019-03-28 22:41:02,399 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 24.23/11.37 [2019-03-28 22:41:02,399 INFO L379 BuchiCegarLoop]: Difference is false 24.23/11.37 [2019-03-28 22:41:02,399 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 24.23/11.37 [2019-03-28 22:41:02,399 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 24.23/11.37 [2019-03-28 22:41:02,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. 24.23/11.37 [2019-03-28 22:41:02,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 24.23/11.37 [2019-03-28 22:41:02,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.23/11.37 [2019-03-28 22:41:02,421 INFO L119 BuchiIsEmpty]: Starting construction of run 24.23/11.37 [2019-03-28 22:41:02,426 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 24.23/11.37 [2019-03-28 22:41:02,426 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 24.23/11.37 [2019-03-28 22:41:02,426 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 24.23/11.37 [2019-03-28 22:41:02,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. 24.23/11.37 [2019-03-28 22:41:02,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 24.23/11.37 [2019-03-28 22:41:02,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.23/11.37 [2019-03-28 22:41:02,427 INFO L119 BuchiIsEmpty]: Starting construction of run 24.23/11.37 [2019-03-28 22:41:02,428 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 24.23/11.37 [2019-03-28 22:41:02,428 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 24.23/11.37 [2019-03-28 22:41:02,433 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [41] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 7#L25-2true 24.23/11.37 [2019-03-28 22:41:02,434 INFO L796 eck$LassoCheckResult]: Loop: 7#L25-2true [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 9#L25true [59] L25-->L26: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 4#L26true [39] L26-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (< v_ULTIMATE.start_main_~x~0_8 v_ULTIMATE.start_main_~y~0_9)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 8#L26-2true [48] L26-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 7#L25-2true 24.23/11.37 [2019-03-28 22:41:02,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.37 [2019-03-28 22:41:02,440 INFO L82 PathProgramCache]: Analyzing trace with hash 72, now seen corresponding path program 1 times 24.23/11.37 [2019-03-28 22:41:02,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.37 [2019-03-28 22:41:02,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.37 [2019-03-28 22:41:02,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.37 [2019-03-28 22:41:02,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.23/11.37 [2019-03-28 22:41:02,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.37 [2019-03-28 22:41:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.37 [2019-03-28 22:41:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.37 [2019-03-28 22:41:02,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.37 [2019-03-28 22:41:02,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2381654, now seen corresponding path program 1 times 24.23/11.37 [2019-03-28 22:41:02,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.37 [2019-03-28 22:41:02,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.37 [2019-03-28 22:41:02,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.37 [2019-03-28 22:41:02,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.23/11.37 [2019-03-28 22:41:02,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.37 [2019-03-28 22:41:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.37 [2019-03-28 22:41:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.37 [2019-03-28 22:41:02,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.37 [2019-03-28 22:41:02,529 INFO L82 PathProgramCache]: Analyzing trace with hash 67951645, now seen corresponding path program 1 times 24.23/11.37 [2019-03-28 22:41:02,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.37 [2019-03-28 22:41:02,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.37 [2019-03-28 22:41:02,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.37 [2019-03-28 22:41:02,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.23/11.37 [2019-03-28 22:41:02,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.37 [2019-03-28 22:41:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.37 [2019-03-28 22:41:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.37 [2019-03-28 22:41:02,614 INFO L216 LassoAnalysis]: Preferences: 24.23/11.37 [2019-03-28 22:41:02,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.23/11.37 [2019-03-28 22:41:02,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.23/11.37 [2019-03-28 22:41:02,615 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.23/11.37 [2019-03-28 22:41:02,616 INFO L127 ssoRankerPreferences]: Use exernal solver: true 24.23/11.37 [2019-03-28 22:41:02,616 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.37 [2019-03-28 22:41:02,616 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.23/11.37 [2019-03-28 22:41:02,616 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.23/11.37 [2019-03-28 22:41:02,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 24.23/11.37 [2019-03-28 22:41:02,616 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.23/11.37 [2019-03-28 22:41:02,617 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.23/11.37 [2019-03-28 22:41:02,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.37 [2019-03-28 22:41:02,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.37 [2019-03-28 22:41:02,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.37 [2019-03-28 22:41:02,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.37 [2019-03-28 22:41:02,783 INFO L300 LassoAnalysis]: Preprocessing complete. 24.23/11.37 [2019-03-28 22:41:02,784 INFO L412 LassoAnalysis]: Checking for nontermination... 24.23/11.37 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.37 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.37 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.37 [2019-03-28 22:41:02,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.37 [2019-03-28 22:41:02,793 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.37 [2019-03-28 22:41:02,828 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.23/11.37 [2019-03-28 22:41:02,828 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.23/11.37 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.37 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.37 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.37 [2019-03-28 22:41:02,838 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.37 [2019-03-28 22:41:02,838 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.37 [2019-03-28 22:41:02,867 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.23/11.37 [2019-03-28 22:41:02,867 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: [] 24.23/11.37 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.37 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.37 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.37 [2019-03-28 22:41:02,872 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.37 [2019-03-28 22:41:02,872 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.37 [2019-03-28 22:41:02,900 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.23/11.37 [2019-03-28 22:41:02,901 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.23/11.37 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.37 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.37 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.37 [2019-03-28 22:41:02,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.37 [2019-03-28 22:41:02,906 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.37 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.37 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.37 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.37 [2019-03-28 22:41:02,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 24.23/11.37 [2019-03-28 22:41:02,943 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.37 [2019-03-28 22:41:02,997 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 24.23/11.37 [2019-03-28 22:41:03,000 INFO L216 LassoAnalysis]: Preferences: 24.23/11.37 [2019-03-28 22:41:03,000 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.23/11.37 [2019-03-28 22:41:03,000 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.23/11.37 [2019-03-28 22:41:03,000 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.23/11.37 [2019-03-28 22:41:03,000 INFO L127 ssoRankerPreferences]: Use exernal solver: false 24.23/11.37 [2019-03-28 22:41:03,000 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 24.23/11.37 [2019-03-28 22:41:03,001 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.23/11.37 [2019-03-28 22:41:03,001 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.23/11.37 [2019-03-28 22:41:03,001 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 24.23/11.37 [2019-03-28 22:41:03,001 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.23/11.37 [2019-03-28 22:41:03,001 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.23/11.37 [2019-03-28 22:41:03,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.37 [2019-03-28 22:41:03,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.37 [2019-03-28 22:41:03,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.37 [2019-03-28 22:41:03,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.37 [2019-03-28 22:41:03,090 INFO L300 LassoAnalysis]: Preprocessing complete. 24.23/11.37 [2019-03-28 22:41:03,096 INFO L497 LassoAnalysis]: Using template 'affine'. 24.23/11.37 [2019-03-28 22:41:03,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.37 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.37 Number of strict supporting invariants: 0 24.23/11.37 Number of non-strict supporting invariants: 1 24.23/11.37 Consider only non-deceasing supporting invariants: true 24.23/11.37 Simplify termination arguments: true 24.23/11.37 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.37 [2019-03-28 22:41:03,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.37 [2019-03-28 22:41:03,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.37 [2019-03-28 22:41:03,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.37 [2019-03-28 22:41:03,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.37 [2019-03-28 22:41:03,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.23/11.37 [2019-03-28 22:41:03,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.23/11.37 [2019-03-28 22:41:03,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.23/11.37 [2019-03-28 22:41:03,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.37 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.37 Number of strict supporting invariants: 0 24.23/11.37 Number of non-strict supporting invariants: 1 24.23/11.37 Consider only non-deceasing supporting invariants: true 24.23/11.37 Simplify termination arguments: true 24.23/11.37 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.37 [2019-03-28 22:41:03,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.37 [2019-03-28 22:41:03,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.37 [2019-03-28 22:41:03,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.37 [2019-03-28 22:41:03,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.37 [2019-03-28 22:41:03,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.23/11.37 [2019-03-28 22:41:03,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.23/11.37 [2019-03-28 22:41:03,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.23/11.37 [2019-03-28 22:41:03,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.37 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.37 Number of strict supporting invariants: 0 24.23/11.37 Number of non-strict supporting invariants: 1 24.23/11.37 Consider only non-deceasing supporting invariants: true 24.23/11.37 Simplify termination arguments: true 24.23/11.37 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.37 [2019-03-28 22:41:03,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.37 [2019-03-28 22:41:03,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.23/11.37 [2019-03-28 22:41:03,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.37 [2019-03-28 22:41:03,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.37 [2019-03-28 22:41:03,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.37 [2019-03-28 22:41:03,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.23/11.37 [2019-03-28 22:41:03,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.23/11.37 [2019-03-28 22:41:03,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.23/11.37 [2019-03-28 22:41:03,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.37 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.37 Number of strict supporting invariants: 0 24.23/11.37 Number of non-strict supporting invariants: 1 24.23/11.37 Consider only non-deceasing supporting invariants: true 24.23/11.37 Simplify termination arguments: true 24.23/11.37 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.37 [2019-03-28 22:41:03,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.37 [2019-03-28 22:41:03,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.23/11.37 [2019-03-28 22:41:03,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.37 [2019-03-28 22:41:03,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.37 [2019-03-28 22:41:03,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.37 [2019-03-28 22:41:03,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.23/11.37 [2019-03-28 22:41:03,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.23/11.37 [2019-03-28 22:41:03,166 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 24.23/11.37 [2019-03-28 22:41:03,173 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 24.23/11.37 [2019-03-28 22:41:03,173 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 24.23/11.37 [2019-03-28 22:41:03,175 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 24.23/11.37 [2019-03-28 22:41:03,176 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 24.23/11.37 [2019-03-28 22:41:03,176 INFO L518 LassoAnalysis]: Proved termination. 24.23/11.37 [2019-03-28 22:41:03,176 INFO L520 LassoAnalysis]: Termination argument consisting of: 24.23/11.37 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 24.23/11.37 Supporting invariants [] 24.23/11.37 [2019-03-28 22:41:03,179 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 24.23/11.38 [2019-03-28 22:41:03,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:03,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:03,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:03,223 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:03,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.23/11.38 [2019-03-28 22:41:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:03,354 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:03,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:03,366 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 24.23/11.38 [2019-03-28 22:41:03,372 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 4 loop predicates 24.23/11.38 [2019-03-28 22:41:03,373 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states. Second operand 4 states. 24.23/11.38 [2019-03-28 22:41:03,550 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states.. Second operand 4 states. Result 37 states and 59 transitions. Complement of second has 13 states. 24.23/11.38 [2019-03-28 22:41:03,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states 24.23/11.38 [2019-03-28 22:41:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 24.23/11.38 [2019-03-28 22:41:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. 24.23/11.38 [2019-03-28 22:41:03,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 1 letters. Loop has 4 letters. 24.23/11.38 [2019-03-28 22:41:03,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:03,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 5 letters. Loop has 4 letters. 24.23/11.38 [2019-03-28 22:41:03,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:03,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 1 letters. Loop has 8 letters. 24.23/11.38 [2019-03-28 22:41:03,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:03,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 59 transitions. 24.23/11.38 [2019-03-28 22:41:03,570 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 24.23/11.38 [2019-03-28 22:41:03,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 28 states and 45 transitions. 24.23/11.38 [2019-03-28 22:41:03,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 24.23/11.38 [2019-03-28 22:41:03,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 24.23/11.38 [2019-03-28 22:41:03,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 45 transitions. 24.23/11.38 [2019-03-28 22:41:03,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 24.23/11.38 [2019-03-28 22:41:03,579 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 45 transitions. 24.23/11.38 [2019-03-28 22:41:03,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 45 transitions. 24.23/11.38 [2019-03-28 22:41:03,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. 24.23/11.38 [2019-03-28 22:41:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 24.23/11.38 [2019-03-28 22:41:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. 24.23/11.38 [2019-03-28 22:41:03,612 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 27 transitions. 24.23/11.38 [2019-03-28 22:41:03,613 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 27 transitions. 24.23/11.38 [2019-03-28 22:41:03,613 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 24.23/11.38 [2019-03-28 22:41:03,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 27 transitions. 24.23/11.38 [2019-03-28 22:41:03,615 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 24.23/11.38 [2019-03-28 22:41:03,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.23/11.38 [2019-03-28 22:41:03,616 INFO L119 BuchiIsEmpty]: Starting construction of run 24.23/11.38 [2019-03-28 22:41:03,616 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 24.23/11.38 [2019-03-28 22:41:03,616 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 24.23/11.38 [2019-03-28 22:41:03,617 INFO L794 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 122#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 129#L25 24.23/11.38 [2019-03-28 22:41:03,617 INFO L796 eck$LassoCheckResult]: Loop: 129#L25 [59] L25-->L26: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 116#L26 [55] L26-->L26-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_9 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 117#L26-2 [48] L26-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 130#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 129#L25 24.23/11.38 [2019-03-28 22:41:03,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:03,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2279, now seen corresponding path program 1 times 24.23/11.38 [2019-03-28 22:41:03,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:03,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:03,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:03,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:03,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:03,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:03,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2735580, now seen corresponding path program 1 times 24.23/11.38 [2019-03-28 22:41:03,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:03,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:03,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:03,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:03,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:03,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:03,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2106516418, now seen corresponding path program 1 times 24.23/11.38 [2019-03-28 22:41:03,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:03,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:03,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:03,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:03,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:03,679 INFO L216 LassoAnalysis]: Preferences: 24.23/11.38 [2019-03-28 22:41:03,679 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.23/11.38 [2019-03-28 22:41:03,679 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.23/11.38 [2019-03-28 22:41:03,679 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.23/11.38 [2019-03-28 22:41:03,679 INFO L127 ssoRankerPreferences]: Use exernal solver: true 24.23/11.38 [2019-03-28 22:41:03,680 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:03,680 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.23/11.38 [2019-03-28 22:41:03,680 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.23/11.38 [2019-03-28 22:41:03,680 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 24.23/11.38 [2019-03-28 22:41:03,680 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.23/11.38 [2019-03-28 22:41:03,680 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.23/11.38 [2019-03-28 22:41:03,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:03,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:03,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:03,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:03,782 INFO L300 LassoAnalysis]: Preprocessing complete. 24.23/11.38 [2019-03-28 22:41:03,782 INFO L412 LassoAnalysis]: Checking for nontermination... 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:03,786 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:03,786 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 [2019-03-28 22:41:03,817 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.23/11.38 [2019-03-28 22:41:03,818 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: [] 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:03,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:03,824 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:03,860 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:03,860 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 [2019-03-28 22:41:04,000 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 24.23/11.38 [2019-03-28 22:41:04,003 INFO L216 LassoAnalysis]: Preferences: 24.23/11.38 [2019-03-28 22:41:04,003 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.23/11.38 [2019-03-28 22:41:04,003 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.23/11.38 [2019-03-28 22:41:04,003 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.23/11.38 [2019-03-28 22:41:04,003 INFO L127 ssoRankerPreferences]: Use exernal solver: false 24.23/11.38 [2019-03-28 22:41:04,003 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:04,004 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.23/11.38 [2019-03-28 22:41:04,004 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.23/11.38 [2019-03-28 22:41:04,004 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 24.23/11.38 [2019-03-28 22:41:04,004 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.23/11.38 [2019-03-28 22:41:04,004 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.23/11.38 [2019-03-28 22:41:04,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:04,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:04,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:04,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:04,094 INFO L300 LassoAnalysis]: Preprocessing complete. 24.23/11.38 [2019-03-28 22:41:04,094 INFO L497 LassoAnalysis]: Using template 'affine'. 24.23/11.38 [2019-03-28 22:41:04,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.38 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.38 Number of strict supporting invariants: 0 24.23/11.38 Number of non-strict supporting invariants: 1 24.23/11.38 Consider only non-deceasing supporting invariants: true 24.23/11.38 Simplify termination arguments: true 24.23/11.38 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.38 [2019-03-28 22:41:04,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.38 [2019-03-28 22:41:04,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.38 [2019-03-28 22:41:04,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.38 [2019-03-28 22:41:04,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.38 [2019-03-28 22:41:04,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.23/11.38 [2019-03-28 22:41:04,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.23/11.38 [2019-03-28 22:41:04,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.23/11.38 [2019-03-28 22:41:04,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.38 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.38 Number of strict supporting invariants: 0 24.23/11.38 Number of non-strict supporting invariants: 1 24.23/11.38 Consider only non-deceasing supporting invariants: true 24.23/11.38 Simplify termination arguments: true 24.23/11.38 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.38 [2019-03-28 22:41:04,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.38 [2019-03-28 22:41:04,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.23/11.38 [2019-03-28 22:41:04,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.38 [2019-03-28 22:41:04,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.38 [2019-03-28 22:41:04,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.38 [2019-03-28 22:41:04,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.23/11.38 [2019-03-28 22:41:04,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.23/11.38 [2019-03-28 22:41:04,111 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 24.23/11.38 [2019-03-28 22:41:04,119 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 24.23/11.38 [2019-03-28 22:41:04,119 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 24.23/11.38 [2019-03-28 22:41:04,120 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 24.23/11.38 [2019-03-28 22:41:04,120 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 24.23/11.38 [2019-03-28 22:41:04,120 INFO L518 LassoAnalysis]: Proved termination. 24.23/11.38 [2019-03-28 22:41:04,121 INFO L520 LassoAnalysis]: Termination argument consisting of: 24.23/11.38 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 24.23/11.38 Supporting invariants [] 24.23/11.38 [2019-03-28 22:41:04,121 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 24.23/11.38 [2019-03-28 22:41:04,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:04,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:04,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:04,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:04,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.23/11.38 [2019-03-28 22:41:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:04,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:04,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:04,190 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 24.23/11.38 [2019-03-28 22:41:04,191 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 24.23/11.38 [2019-03-28 22:41:04,191 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 27 transitions. cyclomatic complexity: 13 Second operand 4 states. 24.23/11.38 [2019-03-28 22:41:04,239 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 27 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 34 states and 64 transitions. Complement of second has 9 states. 24.23/11.38 [2019-03-28 22:41:04,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states 24.23/11.38 [2019-03-28 22:41:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 24.23/11.38 [2019-03-28 22:41:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. 24.23/11.38 [2019-03-28 22:41:04,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. 24.23/11.38 [2019-03-28 22:41:04,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:04,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 4 letters. 24.23/11.38 [2019-03-28 22:41:04,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:04,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 8 letters. 24.23/11.38 [2019-03-28 22:41:04,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:04,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 64 transitions. 24.23/11.38 [2019-03-28 22:41:04,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 24.23/11.38 [2019-03-28 22:41:04,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 27 states and 43 transitions. 24.23/11.38 [2019-03-28 22:41:04,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 24.23/11.38 [2019-03-28 22:41:04,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 24.23/11.38 [2019-03-28 22:41:04,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 43 transitions. 24.23/11.38 [2019-03-28 22:41:04,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 24.23/11.38 [2019-03-28 22:41:04,249 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 43 transitions. 24.23/11.38 [2019-03-28 22:41:04,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 43 transitions. 24.23/11.38 [2019-03-28 22:41:04,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. 24.23/11.38 [2019-03-28 22:41:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 24.23/11.38 [2019-03-28 22:41:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. 24.23/11.38 [2019-03-28 22:41:04,252 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 38 transitions. 24.23/11.38 [2019-03-28 22:41:04,252 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 38 transitions. 24.23/11.38 [2019-03-28 22:41:04,252 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 24.23/11.38 [2019-03-28 22:41:04,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 38 transitions. 24.23/11.38 [2019-03-28 22:41:04,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 24.23/11.38 [2019-03-28 22:41:04,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.23/11.38 [2019-03-28 22:41:04,254 INFO L119 BuchiIsEmpty]: Starting construction of run 24.23/11.38 [2019-03-28 22:41:04,254 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 24.23/11.38 [2019-03-28 22:41:04,254 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 24.23/11.38 [2019-03-28 22:41:04,254 INFO L794 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 229#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 245#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 230#L33 24.23/11.38 [2019-03-28 22:41:04,255 INFO L796 eck$LassoCheckResult]: Loop: 230#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 224#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 225#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 239#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 230#L33 24.23/11.38 [2019-03-28 22:41:04,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:04,255 INFO L82 PathProgramCache]: Analyzing trace with hash 70700, now seen corresponding path program 1 times 24.23/11.38 [2019-03-28 22:41:04,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:04,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:04,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:04,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:04,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:04,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:04,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2629843, now seen corresponding path program 1 times 24.23/11.38 [2019-03-28 22:41:04,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:04,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:04,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:04,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:04,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:04,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:04,271 INFO L82 PathProgramCache]: Analyzing trace with hash 870131582, now seen corresponding path program 1 times 24.23/11.38 [2019-03-28 22:41:04,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:04,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:04,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:04,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:04,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:04,305 INFO L216 LassoAnalysis]: Preferences: 24.23/11.38 [2019-03-28 22:41:04,305 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.23/11.38 [2019-03-28 22:41:04,305 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.23/11.38 [2019-03-28 22:41:04,305 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.23/11.38 [2019-03-28 22:41:04,305 INFO L127 ssoRankerPreferences]: Use exernal solver: true 24.23/11.38 [2019-03-28 22:41:04,305 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:04,305 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.23/11.38 [2019-03-28 22:41:04,306 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.23/11.38 [2019-03-28 22:41:04,306 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 24.23/11.38 [2019-03-28 22:41:04,306 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.23/11.38 [2019-03-28 22:41:04,306 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.23/11.38 [2019-03-28 22:41:04,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:04,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:04,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:04,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:04,378 INFO L300 LassoAnalysis]: Preprocessing complete. 24.23/11.38 [2019-03-28 22:41:04,378 INFO L412 LassoAnalysis]: Checking for nontermination... 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:04,383 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:04,383 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 [2019-03-28 22:41:04,387 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.23/11.38 [2019-03-28 22:41:04,387 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:04,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:04,415 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 [2019-03-28 22:41:04,442 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.23/11.38 [2019-03-28 22:41:04,442 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:04,448 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:04,448 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:04,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:04,499 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 [2019-03-28 22:41:04,718 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 24.23/11.38 [2019-03-28 22:41:04,721 INFO L216 LassoAnalysis]: Preferences: 24.23/11.38 [2019-03-28 22:41:04,721 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.23/11.38 [2019-03-28 22:41:04,721 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.23/11.38 [2019-03-28 22:41:04,721 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.23/11.38 [2019-03-28 22:41:04,721 INFO L127 ssoRankerPreferences]: Use exernal solver: false 24.23/11.38 [2019-03-28 22:41:04,722 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:04,722 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.23/11.38 [2019-03-28 22:41:04,722 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.23/11.38 [2019-03-28 22:41:04,722 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 24.23/11.38 [2019-03-28 22:41:04,722 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.23/11.38 [2019-03-28 22:41:04,722 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.23/11.38 [2019-03-28 22:41:04,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:04,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:04,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:04,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:04,809 INFO L300 LassoAnalysis]: Preprocessing complete. 24.23/11.38 [2019-03-28 22:41:04,810 INFO L497 LassoAnalysis]: Using template 'affine'. 24.23/11.38 [2019-03-28 22:41:04,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.38 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.38 Number of strict supporting invariants: 0 24.23/11.38 Number of non-strict supporting invariants: 1 24.23/11.38 Consider only non-deceasing supporting invariants: true 24.23/11.38 Simplify termination arguments: true 24.23/11.38 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.38 [2019-03-28 22:41:04,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.38 [2019-03-28 22:41:04,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.23/11.38 [2019-03-28 22:41:04,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.38 [2019-03-28 22:41:04,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.38 [2019-03-28 22:41:04,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.38 [2019-03-28 22:41:04,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.23/11.38 [2019-03-28 22:41:04,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.23/11.38 [2019-03-28 22:41:04,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.23/11.38 [2019-03-28 22:41:04,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.38 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.38 Number of strict supporting invariants: 0 24.23/11.38 Number of non-strict supporting invariants: 1 24.23/11.38 Consider only non-deceasing supporting invariants: true 24.23/11.38 Simplify termination arguments: true 24.23/11.38 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.38 [2019-03-28 22:41:04,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.38 [2019-03-28 22:41:04,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.38 [2019-03-28 22:41:04,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.38 [2019-03-28 22:41:04,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.38 [2019-03-28 22:41:04,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.23/11.38 [2019-03-28 22:41:04,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.23/11.38 [2019-03-28 22:41:04,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.23/11.38 [2019-03-28 22:41:04,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.38 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.38 Number of strict supporting invariants: 0 24.23/11.38 Number of non-strict supporting invariants: 1 24.23/11.38 Consider only non-deceasing supporting invariants: true 24.23/11.38 Simplify termination arguments: true 24.23/11.38 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.38 [2019-03-28 22:41:04,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.38 [2019-03-28 22:41:04,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.23/11.38 [2019-03-28 22:41:04,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.38 [2019-03-28 22:41:04,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.38 [2019-03-28 22:41:04,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.38 [2019-03-28 22:41:04,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.23/11.38 [2019-03-28 22:41:04,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.23/11.38 [2019-03-28 22:41:04,830 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 24.23/11.38 [2019-03-28 22:41:04,835 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 24.23/11.38 [2019-03-28 22:41:04,835 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 24.23/11.38 [2019-03-28 22:41:04,836 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 24.23/11.38 [2019-03-28 22:41:04,836 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 24.23/11.38 [2019-03-28 22:41:04,836 INFO L518 LassoAnalysis]: Proved termination. 24.23/11.38 [2019-03-28 22:41:04,836 INFO L520 LassoAnalysis]: Termination argument consisting of: 24.23/11.38 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 24.23/11.38 Supporting invariants [] 24.23/11.38 [2019-03-28 22:41:04,837 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 24.23/11.38 [2019-03-28 22:41:04,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:04,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:04,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:04,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:04,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.23/11.38 [2019-03-28 22:41:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:04,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:04,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:04,904 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 24.23/11.38 [2019-03-28 22:41:04,905 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 24.23/11.38 [2019-03-28 22:41:04,905 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 38 transitions. cyclomatic complexity: 18 Second operand 4 states. 24.23/11.38 [2019-03-28 22:41:04,975 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 38 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 39 states and 66 transitions. Complement of second has 17 states. 24.23/11.38 [2019-03-28 22:41:04,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 24.23/11.38 [2019-03-28 22:41:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 24.23/11.38 [2019-03-28 22:41:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. 24.23/11.38 [2019-03-28 22:41:04,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. 24.23/11.38 [2019-03-28 22:41:04,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:04,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 7 letters. Loop has 4 letters. 24.23/11.38 [2019-03-28 22:41:04,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:04,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 3 letters. Loop has 8 letters. 24.23/11.38 [2019-03-28 22:41:04,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:04,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 66 transitions. 24.23/11.38 [2019-03-28 22:41:04,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 24.23/11.38 [2019-03-28 22:41:04,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 31 states and 51 transitions. 24.23/11.38 [2019-03-28 22:41:04,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 24.23/11.38 [2019-03-28 22:41:04,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 24.23/11.38 [2019-03-28 22:41:04,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 51 transitions. 24.23/11.38 [2019-03-28 22:41:04,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 24.23/11.38 [2019-03-28 22:41:04,983 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 51 transitions. 24.23/11.38 [2019-03-28 22:41:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 51 transitions. 24.23/11.38 [2019-03-28 22:41:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. 24.23/11.38 [2019-03-28 22:41:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 24.23/11.38 [2019-03-28 22:41:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. 24.23/11.38 [2019-03-28 22:41:04,986 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 24.23/11.38 [2019-03-28 22:41:04,986 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. 24.23/11.38 [2019-03-28 22:41:04,986 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 24.23/11.38 [2019-03-28 22:41:04,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. 24.23/11.38 [2019-03-28 22:41:04,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 24.23/11.38 [2019-03-28 22:41:04,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.23/11.38 [2019-03-28 22:41:04,987 INFO L119 BuchiIsEmpty]: Starting construction of run 24.23/11.38 [2019-03-28 22:41:04,988 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 24.23/11.38 [2019-03-28 22:41:04,988 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] 24.23/11.38 [2019-03-28 22:41:04,988 INFO L794 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 362#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 383#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 363#L33 24.23/11.38 [2019-03-28 22:41:04,989 INFO L796 eck$LassoCheckResult]: Loop: 363#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 357#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 358#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 379#L25 [59] L25-->L26: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 373#L26 [39] L26-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (< v_ULTIMATE.start_main_~x~0_8 v_ULTIMATE.start_main_~y~0_9)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 384#L26-2 [48] L26-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 378#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 374#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 363#L33 24.23/11.38 [2019-03-28 22:41:04,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:04,989 INFO L82 PathProgramCache]: Analyzing trace with hash 70700, now seen corresponding path program 2 times 24.23/11.38 [2019-03-28 22:41:04,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:04,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:04,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:04,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:04,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:04,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:04,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2067312616, now seen corresponding path program 1 times 24.23/11.38 [2019-03-28 22:41:04,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:04,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:04,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:04,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:04,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:05,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:05,009 INFO L82 PathProgramCache]: Analyzing trace with hash 711223571, now seen corresponding path program 1 times 24.23/11.38 [2019-03-28 22:41:05,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:05,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:05,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:05,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:05,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:05,079 INFO L216 LassoAnalysis]: Preferences: 24.23/11.38 [2019-03-28 22:41:05,079 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.23/11.38 [2019-03-28 22:41:05,079 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.23/11.38 [2019-03-28 22:41:05,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.23/11.38 [2019-03-28 22:41:05,080 INFO L127 ssoRankerPreferences]: Use exernal solver: true 24.23/11.38 [2019-03-28 22:41:05,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:05,080 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.23/11.38 [2019-03-28 22:41:05,080 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.23/11.38 [2019-03-28 22:41:05,080 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 24.23/11.38 [2019-03-28 22:41:05,080 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.23/11.38 [2019-03-28 22:41:05,080 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.23/11.38 [2019-03-28 22:41:05,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:05,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:05,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:05,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:05,144 INFO L300 LassoAnalysis]: Preprocessing complete. 24.23/11.38 [2019-03-28 22:41:05,144 INFO L412 LassoAnalysis]: Checking for nontermination... 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:05,152 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:05,152 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 [2019-03-28 22:41:05,179 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.23/11.38 [2019-03-28 22:41:05,179 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:05,183 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:05,184 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 [2019-03-28 22:41:05,211 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.23/11.38 [2019-03-28 22:41:05,211 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:05,215 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:05,215 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 [2019-03-28 22:41:05,242 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.23/11.38 [2019-03-28 22:41:05,242 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:05,247 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:05,247 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:05,277 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:05,277 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 [2019-03-28 22:41:05,408 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 24.23/11.38 [2019-03-28 22:41:05,410 INFO L216 LassoAnalysis]: Preferences: 24.23/11.38 [2019-03-28 22:41:05,410 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.23/11.38 [2019-03-28 22:41:05,410 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.23/11.38 [2019-03-28 22:41:05,410 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.23/11.38 [2019-03-28 22:41:05,410 INFO L127 ssoRankerPreferences]: Use exernal solver: false 24.23/11.38 [2019-03-28 22:41:05,411 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:05,411 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.23/11.38 [2019-03-28 22:41:05,411 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.23/11.38 [2019-03-28 22:41:05,411 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 24.23/11.38 [2019-03-28 22:41:05,411 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.23/11.38 [2019-03-28 22:41:05,411 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.23/11.38 [2019-03-28 22:41:05,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:05,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:05,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:05,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:05,476 INFO L300 LassoAnalysis]: Preprocessing complete. 24.23/11.38 [2019-03-28 22:41:05,477 INFO L497 LassoAnalysis]: Using template 'affine'. 24.23/11.38 [2019-03-28 22:41:05,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.38 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.38 Number of strict supporting invariants: 0 24.23/11.38 Number of non-strict supporting invariants: 1 24.23/11.38 Consider only non-deceasing supporting invariants: true 24.23/11.38 Simplify termination arguments: true 24.23/11.38 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.38 [2019-03-28 22:41:05,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.38 [2019-03-28 22:41:05,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.23/11.38 [2019-03-28 22:41:05,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.38 [2019-03-28 22:41:05,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.38 [2019-03-28 22:41:05,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.38 [2019-03-28 22:41:05,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.23/11.38 [2019-03-28 22:41:05,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.23/11.38 [2019-03-28 22:41:05,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.23/11.38 [2019-03-28 22:41:05,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.38 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.38 Number of strict supporting invariants: 0 24.23/11.38 Number of non-strict supporting invariants: 1 24.23/11.38 Consider only non-deceasing supporting invariants: true 24.23/11.38 Simplify termination arguments: true 24.23/11.38 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.38 [2019-03-28 22:41:05,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.38 [2019-03-28 22:41:05,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.38 [2019-03-28 22:41:05,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.38 [2019-03-28 22:41:05,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.38 [2019-03-28 22:41:05,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.23/11.38 [2019-03-28 22:41:05,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.23/11.38 [2019-03-28 22:41:05,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.23/11.38 [2019-03-28 22:41:05,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.38 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.38 Number of strict supporting invariants: 0 24.23/11.38 Number of non-strict supporting invariants: 1 24.23/11.38 Consider only non-deceasing supporting invariants: true 24.23/11.38 Simplify termination arguments: true 24.23/11.38 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.38 [2019-03-28 22:41:05,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.38 [2019-03-28 22:41:05,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.38 [2019-03-28 22:41:05,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.38 [2019-03-28 22:41:05,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.38 [2019-03-28 22:41:05,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.23/11.38 [2019-03-28 22:41:05,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.23/11.38 [2019-03-28 22:41:05,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.23/11.38 [2019-03-28 22:41:05,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.38 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.38 Number of strict supporting invariants: 0 24.23/11.38 Number of non-strict supporting invariants: 1 24.23/11.38 Consider only non-deceasing supporting invariants: true 24.23/11.38 Simplify termination arguments: true 24.23/11.38 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.38 [2019-03-28 22:41:05,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.38 [2019-03-28 22:41:05,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.23/11.38 [2019-03-28 22:41:05,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.38 [2019-03-28 22:41:05,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.38 [2019-03-28 22:41:05,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.38 [2019-03-28 22:41:05,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.23/11.38 [2019-03-28 22:41:05,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.23/11.38 [2019-03-28 22:41:05,500 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 24.23/11.38 [2019-03-28 22:41:05,504 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 24.23/11.38 [2019-03-28 22:41:05,504 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 24.23/11.38 [2019-03-28 22:41:05,505 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 24.23/11.38 [2019-03-28 22:41:05,505 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 24.23/11.38 [2019-03-28 22:41:05,505 INFO L518 LassoAnalysis]: Proved termination. 24.23/11.38 [2019-03-28 22:41:05,505 INFO L520 LassoAnalysis]: Termination argument consisting of: 24.23/11.38 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 24.23/11.38 Supporting invariants [] 24.23/11.38 [2019-03-28 22:41:05,506 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 24.23/11.38 [2019-03-28 22:41:05,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:05,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:05,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:05,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:05,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.23/11.38 [2019-03-28 22:41:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:05,578 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 24.23/11.38 [2019-03-28 22:41:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:05,583 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 24.23/11.38 [2019-03-28 22:41:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:05,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:05,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:05,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:05,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:05,617 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization 24.23/11.38 [2019-03-28 22:41:05,618 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 5 loop predicates 24.23/11.38 [2019-03-28 22:41:05,618 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 21 Second operand 5 states. 24.23/11.38 [2019-03-28 22:41:05,821 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 72 states and 111 transitions. Complement of second has 28 states. 24.23/11.38 [2019-03-28 22:41:05,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 7 non-accepting loop states 3 accepting loop states 24.23/11.38 [2019-03-28 22:41:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 24.23/11.38 [2019-03-28 22:41:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. 24.23/11.38 [2019-03-28 22:41:05,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 34 transitions. Stem has 3 letters. Loop has 8 letters. 24.23/11.38 [2019-03-28 22:41:05,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:05,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 34 transitions. Stem has 11 letters. Loop has 8 letters. 24.23/11.38 [2019-03-28 22:41:05,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:05,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 34 transitions. Stem has 3 letters. Loop has 16 letters. 24.23/11.38 [2019-03-28 22:41:05,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:05,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 111 transitions. 24.23/11.38 [2019-03-28 22:41:05,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 24.23/11.38 [2019-03-28 22:41:05,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 46 states and 71 transitions. 24.23/11.38 [2019-03-28 22:41:05,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 24.23/11.38 [2019-03-28 22:41:05,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 24.23/11.38 [2019-03-28 22:41:05,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 71 transitions. 24.23/11.38 [2019-03-28 22:41:05,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 24.23/11.38 [2019-03-28 22:41:05,830 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 71 transitions. 24.23/11.38 [2019-03-28 22:41:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 71 transitions. 24.23/11.38 [2019-03-28 22:41:05,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. 24.23/11.38 [2019-03-28 22:41:05,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. 24.23/11.38 [2019-03-28 22:41:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 60 transitions. 24.23/11.38 [2019-03-28 22:41:05,834 INFO L729 BuchiCegarLoop]: Abstraction has 38 states and 60 transitions. 24.23/11.38 [2019-03-28 22:41:05,834 INFO L609 BuchiCegarLoop]: Abstraction has 38 states and 60 transitions. 24.23/11.38 [2019-03-28 22:41:05,834 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 24.23/11.38 [2019-03-28 22:41:05,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 60 transitions. 24.23/11.38 [2019-03-28 22:41:05,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 24.23/11.38 [2019-03-28 22:41:05,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.23/11.38 [2019-03-28 22:41:05,835 INFO L119 BuchiIsEmpty]: Starting construction of run 24.23/11.38 [2019-03-28 22:41:05,836 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1] 24.23/11.38 [2019-03-28 22:41:05,836 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] 24.23/11.38 [2019-03-28 22:41:05,836 INFO L794 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 608#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 620#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 609#L33 [43] L33-->L33-2: Formula: (and (< v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~x~0_12 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 603#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 604#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 639#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 626#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 621#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 618#L25-2 24.23/11.38 [2019-03-28 22:41:05,837 INFO L796 eck$LassoCheckResult]: Loop: 618#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 616#L25 [59] L25-->L26: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 605#L26 [39] L26-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (< v_ULTIMATE.start_main_~x~0_8 v_ULTIMATE.start_main_~y~0_9)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 606#L26-2 [48] L26-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 633#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 631#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 610#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 603#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 604#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 639#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 626#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 621#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 618#L25-2 24.23/11.38 [2019-03-28 22:41:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1694349607, now seen corresponding path program 1 times 24.23/11.38 [2019-03-28 22:41:05,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:05,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:05,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:05,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:05,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:05,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1429426182, now seen corresponding path program 2 times 24.23/11.38 [2019-03-28 22:41:05,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:05,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:05,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:05,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:05,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:05,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:05,859 INFO L82 PathProgramCache]: Analyzing trace with hash -450661678, now seen corresponding path program 1 times 24.23/11.38 [2019-03-28 22:41:05,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:05,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:05,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:05,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:05,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:05,940 INFO L216 LassoAnalysis]: Preferences: 24.23/11.38 [2019-03-28 22:41:05,941 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.23/11.38 [2019-03-28 22:41:05,941 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.23/11.38 [2019-03-28 22:41:05,941 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.23/11.38 [2019-03-28 22:41:05,941 INFO L127 ssoRankerPreferences]: Use exernal solver: true 24.23/11.38 [2019-03-28 22:41:05,941 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:05,941 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.23/11.38 [2019-03-28 22:41:05,941 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.23/11.38 [2019-03-28 22:41:05,941 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 24.23/11.38 [2019-03-28 22:41:05,942 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.23/11.38 [2019-03-28 22:41:05,942 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.23/11.38 [2019-03-28 22:41:05,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:05,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:05,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:05,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:06,004 INFO L300 LassoAnalysis]: Preprocessing complete. 24.23/11.38 [2019-03-28 22:41:06,004 INFO L412 LassoAnalysis]: Checking for nontermination... 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:06,008 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:06,008 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:06,042 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:06,043 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 [2019-03-28 22:41:06,085 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 24.23/11.38 [2019-03-28 22:41:06,087 INFO L216 LassoAnalysis]: Preferences: 24.23/11.38 [2019-03-28 22:41:06,087 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.23/11.38 [2019-03-28 22:41:06,087 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.23/11.38 [2019-03-28 22:41:06,088 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.23/11.38 [2019-03-28 22:41:06,088 INFO L127 ssoRankerPreferences]: Use exernal solver: false 24.23/11.38 [2019-03-28 22:41:06,088 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:06,088 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.23/11.38 [2019-03-28 22:41:06,088 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.23/11.38 [2019-03-28 22:41:06,088 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 24.23/11.38 [2019-03-28 22:41:06,088 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.23/11.38 [2019-03-28 22:41:06,088 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.23/11.38 [2019-03-28 22:41:06,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:06,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:06,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:06,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:06,146 INFO L300 LassoAnalysis]: Preprocessing complete. 24.23/11.38 [2019-03-28 22:41:06,147 INFO L497 LassoAnalysis]: Using template 'affine'. 24.23/11.38 [2019-03-28 22:41:06,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.38 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.38 Number of strict supporting invariants: 0 24.23/11.38 Number of non-strict supporting invariants: 1 24.23/11.38 Consider only non-deceasing supporting invariants: true 24.23/11.38 Simplify termination arguments: true 24.23/11.38 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.38 [2019-03-28 22:41:06,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.38 [2019-03-28 22:41:06,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.38 [2019-03-28 22:41:06,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.38 [2019-03-28 22:41:06,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.38 [2019-03-28 22:41:06,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.23/11.38 [2019-03-28 22:41:06,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.23/11.38 [2019-03-28 22:41:06,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.23/11.38 [2019-03-28 22:41:06,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.38 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.38 Number of strict supporting invariants: 0 24.23/11.38 Number of non-strict supporting invariants: 1 24.23/11.38 Consider only non-deceasing supporting invariants: true 24.23/11.38 Simplify termination arguments: true 24.23/11.38 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.38 [2019-03-28 22:41:06,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.38 [2019-03-28 22:41:06,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.23/11.38 [2019-03-28 22:41:06,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.38 [2019-03-28 22:41:06,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.38 [2019-03-28 22:41:06,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.38 [2019-03-28 22:41:06,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.23/11.38 [2019-03-28 22:41:06,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.23/11.38 [2019-03-28 22:41:06,158 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 24.23/11.38 [2019-03-28 22:41:06,161 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 24.23/11.38 [2019-03-28 22:41:06,161 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 24.23/11.38 [2019-03-28 22:41:06,161 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 24.23/11.38 [2019-03-28 22:41:06,161 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 24.23/11.38 [2019-03-28 22:41:06,162 INFO L518 LassoAnalysis]: Proved termination. 24.23/11.38 [2019-03-28 22:41:06,162 INFO L520 LassoAnalysis]: Termination argument consisting of: 24.23/11.38 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 24.23/11.38 Supporting invariants [] 24.23/11.38 [2019-03-28 22:41:06,162 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 24.23/11.38 [2019-03-28 22:41:06,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:06,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:06,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:06,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:06,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.23/11.38 [2019-03-28 22:41:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:06,264 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 24.23/11.38 [2019-03-28 22:41:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:06,271 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 24.23/11.38 [2019-03-28 22:41:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:06,277 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 24.23/11.38 [2019-03-28 22:41:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:06,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:06,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:06,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:06,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:06,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:06,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:06,349 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 9 predicates after loop cannibalization 24.23/11.38 [2019-03-28 22:41:06,350 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 9 loop predicates 24.23/11.38 [2019-03-28 22:41:06,350 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 38 states and 60 transitions. cyclomatic complexity: 25 Second operand 7 states. 24.23/11.38 [2019-03-28 22:41:06,694 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 38 states and 60 transitions. cyclomatic complexity: 25. Second operand 7 states. Result 135 states and 209 transitions. Complement of second has 24 states. 24.23/11.38 [2019-03-28 22:41:06,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 10 non-accepting loop states 3 accepting loop states 24.23/11.38 [2019-03-28 22:41:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 24.23/11.38 [2019-03-28 22:41:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. 24.23/11.38 [2019-03-28 22:41:06,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 9 letters. Loop has 12 letters. 24.23/11.38 [2019-03-28 22:41:06,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:06,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 21 letters. Loop has 12 letters. 24.23/11.38 [2019-03-28 22:41:06,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:06,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 9 letters. Loop has 24 letters. 24.23/11.38 [2019-03-28 22:41:06,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:06,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 209 transitions. 24.23/11.38 [2019-03-28 22:41:06,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 24.23/11.38 [2019-03-28 22:41:06,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 98 states and 151 transitions. 24.23/11.38 [2019-03-28 22:41:06,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 24.23/11.38 [2019-03-28 22:41:06,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 24.23/11.38 [2019-03-28 22:41:06,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 151 transitions. 24.23/11.38 [2019-03-28 22:41:06,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 24.23/11.38 [2019-03-28 22:41:06,711 INFO L706 BuchiCegarLoop]: Abstraction has 98 states and 151 transitions. 24.23/11.38 [2019-03-28 22:41:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 151 transitions. 24.23/11.38 [2019-03-28 22:41:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 52. 24.23/11.38 [2019-03-28 22:41:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. 24.23/11.38 [2019-03-28 22:41:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 82 transitions. 24.23/11.38 [2019-03-28 22:41:06,716 INFO L729 BuchiCegarLoop]: Abstraction has 52 states and 82 transitions. 24.23/11.38 [2019-03-28 22:41:06,717 INFO L609 BuchiCegarLoop]: Abstraction has 52 states and 82 transitions. 24.23/11.38 [2019-03-28 22:41:06,717 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 24.23/11.38 [2019-03-28 22:41:06,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 82 transitions. 24.23/11.38 [2019-03-28 22:41:06,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 24.23/11.38 [2019-03-28 22:41:06,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.23/11.38 [2019-03-28 22:41:06,718 INFO L119 BuchiIsEmpty]: Starting construction of run 24.23/11.38 [2019-03-28 22:41:06,719 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1] 24.23/11.38 [2019-03-28 22:41:06,719 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2, 2, 2, 2, 2] 24.23/11.38 [2019-03-28 22:41:06,719 INFO L794 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 1020#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1040#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 1021#L33 [43] L33-->L33-2: Formula: (and (< v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~x~0_12 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 1022#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 1051#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1052#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 1046#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 1044#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 1024#L25-2 24.23/11.38 [2019-03-28 22:41:06,720 INFO L796 eck$LassoCheckResult]: Loop: 1024#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1025#L25 [59] L25-->L26: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 1017#L26 [39] L26-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (< v_ULTIMATE.start_main_~x~0_8 v_ULTIMATE.start_main_~y~0_9)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 1018#L26-2 [48] L26-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 1028#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1063#L25 [59] L25-->L26: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 1059#L26 [39] L26-->L26-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (< v_ULTIMATE.start_main_~x~0_8 v_ULTIMATE.start_main_~y~0_9)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 1058#L26-2 [48] L26-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 1055#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1054#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 1053#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 1022#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 1051#L25-2 [47] L25-2-->L25: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1052#L25 [51] L25-->L33: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 1046#L33 [56] L33-->L33-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_14 v_ULTIMATE.start_main_~y~0_13) (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~y~0_13 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 1044#L33-2 [38] L33-2-->L25-2: Formula: (= v_ULTIMATE.start_main_~y~0_14 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 1024#L25-2 24.23/11.38 [2019-03-28 22:41:06,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:06,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1694349607, now seen corresponding path program 2 times 24.23/11.38 [2019-03-28 22:41:06,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:06,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:06,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:06,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:06,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:06,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:06,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1302835151, now seen corresponding path program 3 times 24.23/11.38 [2019-03-28 22:41:06,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:06,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:06,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:06,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:06,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:06,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:06,742 INFO L82 PathProgramCache]: Analyzing trace with hash 649152167, now seen corresponding path program 2 times 24.23/11.38 [2019-03-28 22:41:06,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.23/11.38 [2019-03-28 22:41:06,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.23/11.38 [2019-03-28 22:41:06,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:06,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:06,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.23/11.38 [2019-03-28 22:41:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:06,873 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 24.23/11.38 [2019-03-28 22:41:06,886 INFO L216 LassoAnalysis]: Preferences: 24.23/11.38 [2019-03-28 22:41:06,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.23/11.38 [2019-03-28 22:41:06,887 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.23/11.38 [2019-03-28 22:41:06,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.23/11.38 [2019-03-28 22:41:06,887 INFO L127 ssoRankerPreferences]: Use exernal solver: true 24.23/11.38 [2019-03-28 22:41:06,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:06,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.23/11.38 [2019-03-28 22:41:06,888 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.23/11.38 [2019-03-28 22:41:06,888 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 24.23/11.38 [2019-03-28 22:41:06,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.23/11.38 [2019-03-28 22:41:06,888 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.23/11.38 [2019-03-28 22:41:06,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:06,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:06,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:06,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:06,946 INFO L300 LassoAnalysis]: Preprocessing complete. 24.23/11.38 [2019-03-28 22:41:06,946 INFO L412 LassoAnalysis]: Checking for nontermination... 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:06,950 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:06,950 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 [2019-03-28 22:41:06,978 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.23/11.38 [2019-03-28 22:41:06,978 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:06,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:06,983 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 [2019-03-28 22:41:07,012 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.23/11.38 [2019-03-28 22:41:07,012 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:07,017 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:07,017 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 [2019-03-28 22:41:07,046 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.23/11.38 [2019-03-28 22:41:07,046 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:07,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:07,053 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.23/11.38 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.23/11.38 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:07,090 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 24.23/11.38 [2019-03-28 22:41:07,090 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.23/11.38 [2019-03-28 22:41:07,167 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 24.23/11.38 [2019-03-28 22:41:07,169 INFO L216 LassoAnalysis]: Preferences: 24.23/11.38 [2019-03-28 22:41:07,169 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.23/11.38 [2019-03-28 22:41:07,169 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.23/11.38 [2019-03-28 22:41:07,169 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.23/11.38 [2019-03-28 22:41:07,169 INFO L127 ssoRankerPreferences]: Use exernal solver: false 24.23/11.38 [2019-03-28 22:41:07,169 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 24.23/11.38 [2019-03-28 22:41:07,169 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.23/11.38 [2019-03-28 22:41:07,170 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.23/11.38 [2019-03-28 22:41:07,170 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 24.23/11.38 [2019-03-28 22:41:07,170 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.23/11.38 [2019-03-28 22:41:07,170 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.23/11.38 [2019-03-28 22:41:07,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:07,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:07,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:07,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.23/11.38 [2019-03-28 22:41:07,229 INFO L300 LassoAnalysis]: Preprocessing complete. 24.23/11.38 [2019-03-28 22:41:07,230 INFO L497 LassoAnalysis]: Using template 'affine'. 24.23/11.38 [2019-03-28 22:41:07,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.38 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.38 Number of strict supporting invariants: 0 24.23/11.38 Number of non-strict supporting invariants: 1 24.23/11.38 Consider only non-deceasing supporting invariants: true 24.23/11.38 Simplify termination arguments: true 24.23/11.38 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.38 [2019-03-28 22:41:07,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.38 [2019-03-28 22:41:07,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.38 [2019-03-28 22:41:07,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.38 [2019-03-28 22:41:07,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.38 [2019-03-28 22:41:07,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.23/11.38 [2019-03-28 22:41:07,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.23/11.38 [2019-03-28 22:41:07,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.23/11.38 [2019-03-28 22:41:07,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.38 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.38 Number of strict supporting invariants: 0 24.23/11.38 Number of non-strict supporting invariants: 1 24.23/11.38 Consider only non-deceasing supporting invariants: true 24.23/11.38 Simplify termination arguments: true 24.23/11.38 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.38 [2019-03-28 22:41:07,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.38 [2019-03-28 22:41:07,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.23/11.38 [2019-03-28 22:41:07,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.38 [2019-03-28 22:41:07,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.38 [2019-03-28 22:41:07,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.38 [2019-03-28 22:41:07,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.23/11.38 [2019-03-28 22:41:07,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.23/11.38 [2019-03-28 22:41:07,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.23/11.38 [2019-03-28 22:41:07,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.23/11.38 Termination analysis: LINEAR_WITH_GUESSES 24.23/11.38 Number of strict supporting invariants: 0 24.23/11.38 Number of non-strict supporting invariants: 1 24.23/11.38 Consider only non-deceasing supporting invariants: true 24.23/11.38 Simplify termination arguments: true 24.23/11.38 Simplify supporting invariants: trueOverapproximate stem: false 24.23/11.38 [2019-03-28 22:41:07,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.23/11.38 [2019-03-28 22:41:07,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.23/11.38 [2019-03-28 22:41:07,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.23/11.38 [2019-03-28 22:41:07,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.23/11.38 [2019-03-28 22:41:07,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.23/11.38 [2019-03-28 22:41:07,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.23/11.38 [2019-03-28 22:41:07,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.23/11.38 [2019-03-28 22:41:07,244 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 24.23/11.38 [2019-03-28 22:41:07,247 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 24.23/11.38 [2019-03-28 22:41:07,247 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 24.23/11.38 [2019-03-28 22:41:07,248 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 24.23/11.38 [2019-03-28 22:41:07,248 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 24.23/11.38 [2019-03-28 22:41:07,248 INFO L518 LassoAnalysis]: Proved termination. 24.23/11.38 [2019-03-28 22:41:07,248 INFO L520 LassoAnalysis]: Termination argument consisting of: 24.23/11.38 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 24.23/11.38 Supporting invariants [] 24.23/11.38 [2019-03-28 22:41:07,249 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 24.23/11.38 [2019-03-28 22:41:07,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:07,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:07,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:07,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:07,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.23/11.38 [2019-03-28 22:41:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:07,354 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 24.23/11.38 [2019-03-28 22:41:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:07,361 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 24.23/11.38 [2019-03-28 22:41:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:07,367 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 24.23/11.38 [2019-03-28 22:41:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:07,374 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 24.23/11.38 [2019-03-28 22:41:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:07,381 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 24.23/11.38 [2019-03-28 22:41:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.23/11.38 [2019-03-28 22:41:07,388 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 24.23/11.38 [2019-03-28 22:41:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:07,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:07,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:07,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:07,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:07,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:07,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:07,480 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 11 predicates after loop cannibalization 24.23/11.38 [2019-03-28 22:41:07,480 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 11 loop predicates 24.23/11.38 [2019-03-28 22:41:07,480 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 52 states and 82 transitions. cyclomatic complexity: 33 Second operand 8 states. 24.23/11.38 [2019-03-28 22:41:08,060 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 52 states and 82 transitions. cyclomatic complexity: 33. Second operand 8 states. Result 198 states and 286 transitions. Complement of second has 36 states. 24.23/11.38 [2019-03-28 22:41:08,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 16 non-accepting loop states 3 accepting loop states 24.23/11.38 [2019-03-28 22:41:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 24.23/11.38 [2019-03-28 22:41:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 60 transitions. 24.23/11.38 [2019-03-28 22:41:08,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 60 transitions. Stem has 9 letters. Loop has 16 letters. 24.23/11.38 [2019-03-28 22:41:08,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:08,062 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted 24.23/11.38 [2019-03-28 22:41:08,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.23/11.38 [2019-03-28 22:41:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:08,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:08,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.23/11.38 [2019-03-28 22:41:08,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core 24.23/11.38 [2019-03-28 22:41:08,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.23/11.38 [2019-03-28 22:41:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.23/11.38 [2019-03-28 22:41:08,138 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates 24.23/11.38 [2019-03-28 22:41:08,138 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 52 states and 82 transitions. cyclomatic complexity: 33 Second operand 8 states. 24.23/11.38 [2019-03-28 22:41:08,373 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 52 states and 82 transitions. cyclomatic complexity: 33. Second operand 8 states. Result 268 states and 421 transitions. Complement of second has 51 states. 24.23/11.38 [2019-03-28 22:41:08,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states 24.23/11.38 [2019-03-28 22:41:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 24.23/11.38 [2019-03-28 22:41:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. 24.23/11.38 [2019-03-28 22:41:08,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 56 transitions. Stem has 9 letters. Loop has 16 letters. 24.23/11.38 [2019-03-28 22:41:08,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:08,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 56 transitions. Stem has 25 letters. Loop has 16 letters. 24.23/11.38 [2019-03-28 22:41:08,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:08,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 56 transitions. Stem has 9 letters. Loop has 32 letters. 24.23/11.38 [2019-03-28 22:41:08,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.23/11.38 [2019-03-28 22:41:08,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 268 states and 421 transitions. 24.23/11.38 [2019-03-28 22:41:08,381 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 24.23/11.38 [2019-03-28 22:41:08,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 268 states to 0 states and 0 transitions. 24.23/11.38 [2019-03-28 22:41:08,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 24.23/11.38 [2019-03-28 22:41:08,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 24.23/11.38 [2019-03-28 22:41:08,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 24.23/11.38 [2019-03-28 22:41:08,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 24.23/11.38 [2019-03-28 22:41:08,382 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 24.23/11.38 [2019-03-28 22:41:08,382 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 24.23/11.38 [2019-03-28 22:41:08,382 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 24.23/11.38 [2019-03-28 22:41:08,382 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 24.23/11.38 [2019-03-28 22:41:08,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 24.23/11.38 [2019-03-28 22:41:08,383 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 24.23/11.38 [2019-03-28 22:41:08,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 24.23/11.38 [2019-03-28 22:41:08,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:41:08 BasicIcfg 24.23/11.38 [2019-03-28 22:41:08,389 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 24.23/11.38 [2019-03-28 22:41:08,390 INFO L168 Benchmark]: Toolchain (without parser) took 6851.03 ms. Allocated memory was 649.6 MB in the beginning and 758.6 MB in the end (delta: 109.1 MB). Free memory was 559.5 MB in the beginning and 424.9 MB in the end (delta: 134.6 MB). Peak memory consumption was 243.6 MB. Max. memory is 50.3 GB. 24.23/11.38 [2019-03-28 22:41:08,391 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 24.23/11.38 [2019-03-28 22:41:08,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.33 ms. Allocated memory is still 649.6 MB. Free memory was 559.5 MB in the beginning and 548.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 50.3 GB. 24.23/11.38 [2019-03-28 22:41:08,392 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.68 ms. Allocated memory was 649.6 MB in the beginning and 654.3 MB in the end (delta: 4.7 MB). Free memory was 548.8 MB in the beginning and 622.0 MB in the end (delta: -73.2 MB). Peak memory consumption was 21.6 MB. Max. memory is 50.3 GB. 24.23/11.38 [2019-03-28 22:41:08,392 INFO L168 Benchmark]: Boogie Preprocessor took 21.03 ms. Allocated memory is still 654.3 MB. Free memory was 622.0 MB in the beginning and 620.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 24.23/11.38 [2019-03-28 22:41:08,393 INFO L168 Benchmark]: RCFGBuilder took 220.08 ms. Allocated memory is still 654.3 MB. Free memory was 620.6 MB in the beginning and 603.5 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 50.3 GB. 24.23/11.38 [2019-03-28 22:41:08,393 INFO L168 Benchmark]: BlockEncodingV2 took 85.21 ms. Allocated memory is still 654.3 MB. Free memory was 603.5 MB in the beginning and 598.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 24.23/11.38 [2019-03-28 22:41:08,394 INFO L168 Benchmark]: TraceAbstraction took 157.75 ms. Allocated memory is still 654.3 MB. Free memory was 598.1 MB in the beginning and 588.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 24.23/11.38 [2019-03-28 22:41:08,394 INFO L168 Benchmark]: BuchiAutomizer took 6026.30 ms. Allocated memory was 654.3 MB in the beginning and 758.6 MB in the end (delta: 104.3 MB). Free memory was 588.6 MB in the beginning and 424.9 MB in the end (delta: 163.7 MB). Peak memory consumption was 268.0 MB. Max. memory is 50.3 GB. 24.23/11.38 [2019-03-28 22:41:08,399 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 24.23/11.38 --- Results --- 24.23/11.38 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 24.23/11.38 - StatisticsResult: Initial Icfg 24.23/11.38 11 locations, 15 edges 24.23/11.38 - StatisticsResult: Encoded RCFG 24.23/11.38 7 locations, 11 edges 24.23/11.38 * Results from de.uni_freiburg.informatik.ultimate.core: 24.23/11.38 - StatisticsResult: Toolchain Benchmarks 24.23/11.38 Benchmark results are: 24.23/11.38 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 24.23/11.38 * CACSL2BoogieTranslator took 238.33 ms. Allocated memory is still 649.6 MB. Free memory was 559.5 MB in the beginning and 548.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 50.3 GB. 24.23/11.38 * Boogie Procedure Inliner took 96.68 ms. Allocated memory was 649.6 MB in the beginning and 654.3 MB in the end (delta: 4.7 MB). Free memory was 548.8 MB in the beginning and 622.0 MB in the end (delta: -73.2 MB). Peak memory consumption was 21.6 MB. Max. memory is 50.3 GB. 24.23/11.38 * Boogie Preprocessor took 21.03 ms. Allocated memory is still 654.3 MB. Free memory was 622.0 MB in the beginning and 620.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 24.23/11.38 * RCFGBuilder took 220.08 ms. Allocated memory is still 654.3 MB. Free memory was 620.6 MB in the beginning and 603.5 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 50.3 GB. 24.23/11.38 * BlockEncodingV2 took 85.21 ms. Allocated memory is still 654.3 MB. Free memory was 603.5 MB in the beginning and 598.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 24.23/11.38 * TraceAbstraction took 157.75 ms. Allocated memory is still 654.3 MB. Free memory was 598.1 MB in the beginning and 588.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 24.23/11.38 * BuchiAutomizer took 6026.30 ms. Allocated memory was 654.3 MB in the beginning and 758.6 MB in the end (delta: 104.3 MB). Free memory was 588.6 MB in the beginning and 424.9 MB in the end (delta: 163.7 MB). Peak memory consumption was 268.0 MB. Max. memory is 50.3 GB. 24.23/11.38 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 24.23/11.38 - AllSpecificationsHoldResult: All specifications hold 24.23/11.38 We were not able to verify any specifiation because the program does not contain any specification. 24.23/11.38 - InvariantResult [Line: 24]: Loop Invariant 24.23/11.38 Derived loop invariant: 1 24.23/11.38 - StatisticsResult: Ultimate Automizer benchmark data 24.23/11.38 CFG has 1 procedures, 7 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=7occurred 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 24.23/11.38 - StatisticsResult: Constructed decomposition of program 24.23/11.38 Your program was decomposed into 6 terminating modules (0 trivial, 0 deterministic, 6 nondeterministic). One nondeterministic module has affine ranking function y and consists of 8 locations. One nondeterministic module has affine ranking function y and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 6 locations. One nondeterministic module has affine ranking function y and consists of 11 locations. One nondeterministic module has affine ranking function x and consists of 14 locations. One nondeterministic module has affine ranking function x and consists of 13 locations. 24.23/11.38 - StatisticsResult: Timing statistics 24.23/11.38 BüchiAutomizer plugin needed 5.9s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 3.2s. Construction of modules took 0.4s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 5. Nontrivial modules had stage [5, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 9/26 HoareTripleCheckerStatistics: 99 SDtfs, 259 SDslu, 247 SDs, 0 SdLazy, 607 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax151 hnf100 lsp57 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq143 hnf94 smp100 dnf100 smp100 tf107 neg100 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s 24.23/11.38 - TerminationAnalysisResult: Termination proven 24.23/11.38 Buchi Automizer proved that your program is terminating 24.23/11.38 RESULT: Ultimate proved your program to be correct! 24.23/11.38 !SESSION 2019-03-28 22:40:58.274 ----------------------------------------------- 24.23/11.38 eclipse.buildId=unknown 24.23/11.38 java.version=1.8.0_181 24.23/11.38 java.vendor=Oracle Corporation 24.23/11.38 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 24.23/11.38 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 24.23/11.38 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 24.23/11.38 24.23/11.38 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 22:41:08.631 24.23/11.38 !MESSAGE The workspace will exit with unsaved changes in this session. 24.23/11.38 Received shutdown request... 24.23/11.38 Ultimate: 24.23/11.38 GTK+ Version Check 24.23/11.38 EOF