22.29/12.13 YES 22.29/12.13 22.29/12.14 Ultimate: Cannot open display: 22.29/12.14 This is Ultimate 0.1.24-8dc7c08-m 22.29/12.14 [2019-03-28 12:02:16,161 INFO L170 SettingsManager]: Resetting all preferences to default values... 22.29/12.14 [2019-03-28 12:02:16,163 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 22.29/12.14 [2019-03-28 12:02:16,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 22.29/12.14 [2019-03-28 12:02:16,175 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 22.29/12.14 [2019-03-28 12:02:16,176 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 22.29/12.14 [2019-03-28 12:02:16,177 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 22.29/12.14 [2019-03-28 12:02:16,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 22.29/12.14 [2019-03-28 12:02:16,180 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 22.29/12.14 [2019-03-28 12:02:16,181 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 22.29/12.14 [2019-03-28 12:02:16,182 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 22.29/12.14 [2019-03-28 12:02:16,182 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 22.29/12.14 [2019-03-28 12:02:16,183 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 22.29/12.14 [2019-03-28 12:02:16,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 22.29/12.14 [2019-03-28 12:02:16,185 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 22.29/12.14 [2019-03-28 12:02:16,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 22.29/12.14 [2019-03-28 12:02:16,186 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 22.29/12.14 [2019-03-28 12:02:16,188 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 22.29/12.14 [2019-03-28 12:02:16,190 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 22.29/12.14 [2019-03-28 12:02:16,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 22.29/12.14 [2019-03-28 12:02:16,192 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 22.29/12.14 [2019-03-28 12:02:16,193 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 22.29/12.14 [2019-03-28 12:02:16,196 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 22.29/12.14 [2019-03-28 12:02:16,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 22.29/12.14 [2019-03-28 12:02:16,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 22.29/12.14 [2019-03-28 12:02:16,197 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 22.29/12.14 [2019-03-28 12:02:16,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 22.29/12.14 [2019-03-28 12:02:16,198 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 22.29/12.14 [2019-03-28 12:02:16,198 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 22.29/12.14 [2019-03-28 12:02:16,199 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 22.29/12.14 [2019-03-28 12:02:16,200 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 22.29/12.14 [2019-03-28 12:02:16,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 22.29/12.14 [2019-03-28 12:02:16,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 22.29/12.14 [2019-03-28 12:02:16,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 22.29/12.14 [2019-03-28 12:02:16,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 22.29/12.14 [2019-03-28 12:02:16,203 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 22.29/12.14 [2019-03-28 12:02:16,203 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 22.29/12.14 [2019-03-28 12:02:16,204 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 22.29/12.14 [2019-03-28 12:02:16,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 22.29/12.14 [2019-03-28 12:02:16,205 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 22.29/12.14 [2019-03-28 12:02:16,219 INFO L110 SettingsManager]: Loading preferences was successful 22.29/12.14 [2019-03-28 12:02:16,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 22.29/12.14 [2019-03-28 12:02:16,220 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 22.29/12.14 [2019-03-28 12:02:16,221 INFO L133 SettingsManager]: * Rewrite not-equals=true 22.29/12.14 [2019-03-28 12:02:16,221 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 22.29/12.14 [2019-03-28 12:02:16,221 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 22.29/12.14 [2019-03-28 12:02:16,221 INFO L133 SettingsManager]: * Use SBE=true 22.29/12.14 [2019-03-28 12:02:16,222 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 22.29/12.14 [2019-03-28 12:02:16,222 INFO L133 SettingsManager]: * Use old map elimination=false 22.29/12.14 [2019-03-28 12:02:16,222 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 22.29/12.14 [2019-03-28 12:02:16,222 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 22.29/12.14 [2019-03-28 12:02:16,222 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 22.29/12.14 [2019-03-28 12:02:16,222 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 22.29/12.14 [2019-03-28 12:02:16,223 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 22.29/12.14 [2019-03-28 12:02:16,223 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:16,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 22.29/12.14 [2019-03-28 12:02:16,223 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 22.29/12.14 [2019-03-28 12:02:16,224 INFO L133 SettingsManager]: * Check division by zero=IGNORE 22.29/12.14 [2019-03-28 12:02:16,224 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 22.29/12.14 [2019-03-28 12:02:16,224 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 22.29/12.14 [2019-03-28 12:02:16,224 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 22.29/12.14 [2019-03-28 12:02:16,224 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 22.29/12.14 [2019-03-28 12:02:16,224 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 22.29/12.14 [2019-03-28 12:02:16,225 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 22.29/12.14 [2019-03-28 12:02:16,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 22.29/12.14 [2019-03-28 12:02:16,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 22.29/12.14 [2019-03-28 12:02:16,225 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 22.29/12.14 [2019-03-28 12:02:16,225 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 22.29/12.14 [2019-03-28 12:02:16,226 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 22.29/12.14 [2019-03-28 12:02:16,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 22.29/12.14 [2019-03-28 12:02:16,265 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 22.29/12.14 [2019-03-28 12:02:16,269 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 22.29/12.14 [2019-03-28 12:02:16,270 INFO L271 PluginConnector]: Initializing CDTParser... 22.29/12.14 [2019-03-28 12:02:16,270 INFO L276 PluginConnector]: CDTParser initialized 22.29/12.14 [2019-03-28 12:02:16,271 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 22.29/12.14 [2019-03-28 12:02:16,372 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/99e413b924854662b843259d1b8f3bc9/FLAG466d622d8 22.29/12.14 [2019-03-28 12:02:16,703 INFO L307 CDTParser]: Found 1 translation units. 22.29/12.14 [2019-03-28 12:02:16,704 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 22.29/12.14 [2019-03-28 12:02:16,711 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/99e413b924854662b843259d1b8f3bc9/FLAG466d622d8 22.29/12.14 [2019-03-28 12:02:17,125 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/99e413b924854662b843259d1b8f3bc9 22.29/12.14 [2019-03-28 12:02:17,136 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 22.29/12.14 [2019-03-28 12:02:17,138 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 22.29/12.14 [2019-03-28 12:02:17,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 22.29/12.14 [2019-03-28 12:02:17,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 22.29/12.14 [2019-03-28 12:02:17,144 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 22.29/12.14 [2019-03-28 12:02:17,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:02:17" (1/1) ... 22.29/12.14 [2019-03-28 12:02:17,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5232ae43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:17, skipping insertion in model container 22.29/12.14 [2019-03-28 12:02:17,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:02:17" (1/1) ... 22.29/12.14 [2019-03-28 12:02:17,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 22.29/12.14 [2019-03-28 12:02:17,174 INFO L176 MainTranslator]: Built tables and reachable declarations 22.29/12.14 [2019-03-28 12:02:17,335 INFO L206 PostProcessor]: Analyzing one entry point: main 22.29/12.14 [2019-03-28 12:02:17,339 INFO L191 MainTranslator]: Completed pre-run 22.29/12.14 [2019-03-28 12:02:17,359 INFO L206 PostProcessor]: Analyzing one entry point: main 22.29/12.14 [2019-03-28 12:02:17,373 INFO L195 MainTranslator]: Completed translation 22.29/12.14 [2019-03-28 12:02:17,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:17 WrapperNode 22.29/12.14 [2019-03-28 12:02:17,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 22.29/12.14 [2019-03-28 12:02:17,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 22.29/12.14 [2019-03-28 12:02:17,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 22.29/12.14 [2019-03-28 12:02:17,375 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 22.29/12.14 [2019-03-28 12:02:17,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:17" (1/1) ... 22.29/12.14 [2019-03-28 12:02:17,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:17" (1/1) ... 22.29/12.14 [2019-03-28 12:02:17,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 22.29/12.14 [2019-03-28 12:02:17,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 22.29/12.14 [2019-03-28 12:02:17,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 22.29/12.14 [2019-03-28 12:02:17,464 INFO L276 PluginConnector]: Boogie Preprocessor initialized 22.29/12.14 [2019-03-28 12:02:17,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:17" (1/1) ... 22.29/12.14 [2019-03-28 12:02:17,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:17" (1/1) ... 22.29/12.14 [2019-03-28 12:02:17,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:17" (1/1) ... 22.29/12.14 [2019-03-28 12:02:17,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:17" (1/1) ... 22.29/12.14 [2019-03-28 12:02:17,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:17" (1/1) ... 22.29/12.14 [2019-03-28 12:02:17,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:17" (1/1) ... 22.29/12.14 [2019-03-28 12:02:17,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:17" (1/1) ... 22.29/12.14 [2019-03-28 12:02:17,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 22.29/12.14 [2019-03-28 12:02:17,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 22.29/12.14 [2019-03-28 12:02:17,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... 22.29/12.14 [2019-03-28 12:02:17,485 INFO L276 PluginConnector]: RCFGBuilder initialized 22.29/12.14 [2019-03-28 12:02:17,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:17" (1/1) ... 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 22.29/12.14 [2019-03-28 12:02:17,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 22.29/12.14 [2019-03-28 12:02:17,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 22.29/12.14 [2019-03-28 12:02:17,710 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 22.29/12.14 [2019-03-28 12:02:17,711 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 22.29/12.14 [2019-03-28 12:02:17,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:17 BoogieIcfgContainer 22.29/12.14 [2019-03-28 12:02:17,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 22.29/12.14 [2019-03-28 12:02:17,712 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 22.29/12.14 [2019-03-28 12:02:17,713 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 22.29/12.14 [2019-03-28 12:02:17,715 INFO L276 PluginConnector]: BlockEncodingV2 initialized 22.29/12.14 [2019-03-28 12:02:17,715 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:17" (1/1) ... 22.29/12.14 [2019-03-28 12:02:17,731 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 15 edges 22.29/12.14 [2019-03-28 12:02:17,732 INFO L258 BlockEncoder]: Using Remove infeasible edges 22.29/12.14 [2019-03-28 12:02:17,733 INFO L263 BlockEncoder]: Using Maximize final states 22.29/12.14 [2019-03-28 12:02:17,734 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 22.29/12.14 [2019-03-28 12:02:17,734 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 22.29/12.14 [2019-03-28 12:02:17,736 INFO L296 BlockEncoder]: Using Remove sink states 22.29/12.14 [2019-03-28 12:02:17,737 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 22.29/12.14 [2019-03-28 12:02:17,737 INFO L179 BlockEncoder]: Using Rewrite not-equals 22.29/12.14 [2019-03-28 12:02:17,754 INFO L185 BlockEncoder]: Using Use SBE 22.29/12.14 [2019-03-28 12:02:17,775 INFO L200 BlockEncoder]: SBE split 6 edges 22.29/12.14 [2019-03-28 12:02:17,780 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 22.29/12.14 [2019-03-28 12:02:17,781 INFO L71 MaximizeFinalStates]: 0 new accepting states 22.29/12.14 [2019-03-28 12:02:17,791 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 22.29/12.14 [2019-03-28 12:02:17,793 INFO L70 RemoveSinkStates]: Removed 5 edges and 2 locations by removing sink states 22.29/12.14 [2019-03-28 12:02:17,795 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 22.29/12.14 [2019-03-28 12:02:17,795 INFO L71 MaximizeFinalStates]: 0 new accepting states 22.29/12.14 [2019-03-28 12:02:17,795 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 22.29/12.14 [2019-03-28 12:02:17,795 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 22.29/12.14 [2019-03-28 12:02:17,796 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 16 edges 22.29/12.14 [2019-03-28 12:02:17,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:17 BasicIcfg 22.29/12.14 [2019-03-28 12:02:17,796 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 22.29/12.14 [2019-03-28 12:02:17,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 22.29/12.14 [2019-03-28 12:02:17,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... 22.29/12.14 [2019-03-28 12:02:17,801 INFO L276 PluginConnector]: TraceAbstraction initialized 22.29/12.14 [2019-03-28 12:02:17,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:02:17" (1/4) ... 22.29/12.14 [2019-03-28 12:02:17,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a23f494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:02:17, skipping insertion in model container 22.29/12.14 [2019-03-28 12:02:17,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:17" (2/4) ... 22.29/12.14 [2019-03-28 12:02:17,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a23f494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:02:17, skipping insertion in model container 22.29/12.14 [2019-03-28 12:02:17,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:17" (3/4) ... 22.29/12.14 [2019-03-28 12:02:17,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a23f494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:17, skipping insertion in model container 22.29/12.14 [2019-03-28 12:02:17,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:17" (4/4) ... 22.29/12.14 [2019-03-28 12:02:17,805 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 22.29/12.14 [2019-03-28 12:02:17,816 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 22.29/12.14 [2019-03-28 12:02:17,825 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 22.29/12.14 [2019-03-28 12:02:17,843 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 22.29/12.14 [2019-03-28 12:02:17,871 INFO L133 ementStrategyFactory]: Using default assertion order modulation 22.29/12.14 [2019-03-28 12:02:17,872 INFO L382 AbstractCegarLoop]: Interprodecural is true 22.29/12.14 [2019-03-28 12:02:17,872 INFO L383 AbstractCegarLoop]: Hoare is true 22.29/12.14 [2019-03-28 12:02:17,873 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 22.29/12.14 [2019-03-28 12:02:17,873 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 22.29/12.14 [2019-03-28 12:02:17,873 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 22.29/12.14 [2019-03-28 12:02:17,873 INFO L387 AbstractCegarLoop]: Difference is false 22.29/12.14 [2019-03-28 12:02:17,873 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 22.29/12.14 [2019-03-28 12:02:17,873 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 22.29/12.14 [2019-03-28 12:02:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. 22.29/12.14 [2019-03-28 12:02:17,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 22.29/12.14 [2019-03-28 12:02:17,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. 22.29/12.14 [2019-03-28 12:02:17,951 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 22.29/12.14 [2019-03-28 12:02:17,951 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. 22.29/12.14 [2019-03-28 12:02:17,952 INFO L451 ceAbstractionStarter]: At program point L29-2(lines 18 34) the Hoare annotation is: true 22.29/12.14 [2019-03-28 12:02:17,952 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 33) no Hoare annotation was computed. 22.29/12.14 [2019-03-28 12:02:17,952 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 26) no Hoare annotation was computed. 22.29/12.14 [2019-03-28 12:02:17,952 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 33) no Hoare annotation was computed. 22.29/12.14 [2019-03-28 12:02:17,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:17 BasicIcfg 22.29/12.14 [2019-03-28 12:02:17,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 22.29/12.14 [2019-03-28 12:02:17,961 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 22.29/12.14 [2019-03-28 12:02:17,961 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 22.29/12.14 [2019-03-28 12:02:17,964 INFO L276 PluginConnector]: BuchiAutomizer initialized 22.29/12.14 [2019-03-28 12:02:17,965 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.29/12.14 [2019-03-28 12:02:17,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:02:17" (1/5) ... 22.29/12.14 [2019-03-28 12:02:17,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e86dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:02:17, skipping insertion in model container 22.29/12.14 [2019-03-28 12:02:17,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.29/12.14 [2019-03-28 12:02:17,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:17" (2/5) ... 22.29/12.14 [2019-03-28 12:02:17,967 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e86dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:02:17, skipping insertion in model container 22.29/12.14 [2019-03-28 12:02:17,967 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.29/12.14 [2019-03-28 12:02:17,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:17" (3/5) ... 22.29/12.14 [2019-03-28 12:02:17,967 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e86dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:02:17, skipping insertion in model container 22.29/12.14 [2019-03-28 12:02:17,968 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.29/12.14 [2019-03-28 12:02:17,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:17" (4/5) ... 22.29/12.14 [2019-03-28 12:02:17,968 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e86dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:02:17, skipping insertion in model container 22.29/12.14 [2019-03-28 12:02:17,968 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.29/12.14 [2019-03-28 12:02:17,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:17" (5/5) ... 22.29/12.14 [2019-03-28 12:02:17,970 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 22.29/12.14 [2019-03-28 12:02:17,998 INFO L133 ementStrategyFactory]: Using default assertion order modulation 22.29/12.14 [2019-03-28 12:02:17,998 INFO L374 BuchiCegarLoop]: Interprodecural is true 22.29/12.14 [2019-03-28 12:02:17,999 INFO L375 BuchiCegarLoop]: Hoare is true 22.29/12.14 [2019-03-28 12:02:17,999 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 22.29/12.14 [2019-03-28 12:02:17,999 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 22.29/12.14 [2019-03-28 12:02:17,999 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 22.29/12.14 [2019-03-28 12:02:17,999 INFO L379 BuchiCegarLoop]: Difference is false 22.29/12.14 [2019-03-28 12:02:17,999 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 22.29/12.14 [2019-03-28 12:02:18,000 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 22.29/12.14 [2019-03-28 12:02:18,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 22.29/12.14 [2019-03-28 12:02:18,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 22.29/12.14 [2019-03-28 12:02:18,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.29/12.14 [2019-03-28 12:02:18,021 INFO L119 BuchiIsEmpty]: Starting construction of run 22.29/12.14 [2019-03-28 12:02:18,028 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 22.29/12.14 [2019-03-28 12:02:18,028 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 22.29/12.14 [2019-03-28 12:02:18,028 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 22.29/12.14 [2019-03-28 12:02:18,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 22.29/12.14 [2019-03-28 12:02:18,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 22.29/12.14 [2019-03-28 12:02:18,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.29/12.14 [2019-03-28 12:02:18,029 INFO L119 BuchiIsEmpty]: Starting construction of run 22.29/12.14 [2019-03-28 12:02:18,030 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 22.29/12.14 [2019-03-28 12:02:18,030 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 22.29/12.14 [2019-03-28 12:02:18,035 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [40] ULTIMATE.startENTRY-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~tk~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) (= v_ULTIMATE.start_main_~k~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, 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~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet4_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet5_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~tk~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~an~0] 4#L29-2true 22.29/12.14 [2019-03-28 12:02:18,036 INFO L796 eck$LassoCheckResult]: Loop: 4#L29-2true [60] L29-2-->L19: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= (+ v_ULTIMATE.start_main_~tk~0_5 1) v_ULTIMATE.start_main_~k~0_5) (<= v_ULTIMATE.start_main_~an~0_5 v_ULTIMATE.start_main_~i~0_5)) InVars {ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} OutVars{ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} AuxVars[] AssignedVars[] 7#L19true [67] L19-->L27: Formula: (> v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~an~0_7) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5#L27true [45] L27-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_10 (+ v_ULTIMATE.start_main_~i~0_11 1)) (<= v_ULTIMATE.start_main_~bn~0_8 v_ULTIMATE.start_main_~j~0_10) (<= v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~an~0_8)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4#L29-2true 22.29/12.14 [2019-03-28 12:02:18,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:18,042 INFO L82 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 1 times 22.29/12.14 [2019-03-28 12:02:18,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.29/12.14 [2019-03-28 12:02:18,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.29/12.14 [2019-03-28 12:02:18,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:18,109 INFO L82 PathProgramCache]: Analyzing trace with hash 89573, now seen corresponding path program 1 times 22.29/12.14 [2019-03-28 12:02:18,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.29/12.14 [2019-03-28 12:02:18,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.29/12.14 [2019-03-28 12:02:18,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.29/12.14 [2019-03-28 12:02:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.29/12.14 [2019-03-28 12:02:18,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 22.29/12.14 [2019-03-28 12:02:18,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 22.29/12.14 [2019-03-28 12:02:18,169 INFO L811 eck$LassoCheckResult]: loop already infeasible 22.29/12.14 [2019-03-28 12:02:18,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 22.29/12.14 [2019-03-28 12:02:18,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 22.29/12.14 [2019-03-28 12:02:18,186 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. 22.29/12.14 [2019-03-28 12:02:18,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.29/12.14 [2019-03-28 12:02:18,262 INFO L93 Difference]: Finished difference Result 10 states and 23 transitions. 22.29/12.14 [2019-03-28 12:02:18,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 22.29/12.14 [2019-03-28 12:02:18,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 23 transitions. 22.29/12.14 [2019-03-28 12:02:18,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 22.29/12.14 [2019-03-28 12:02:18,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 23 transitions. 22.29/12.14 [2019-03-28 12:02:18,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 22.29/12.14 [2019-03-28 12:02:18,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 22.29/12.14 [2019-03-28 12:02:18,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 23 transitions. 22.29/12.14 [2019-03-28 12:02:18,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 22.29/12.14 [2019-03-28 12:02:18,274 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 23 transitions. 22.29/12.14 [2019-03-28 12:02:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 23 transitions. 22.29/12.14 [2019-03-28 12:02:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 22.29/12.14 [2019-03-28 12:02:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 22.29/12.14 [2019-03-28 12:02:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. 22.29/12.14 [2019-03-28 12:02:18,304 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 23 transitions. 22.29/12.14 [2019-03-28 12:02:18,304 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 23 transitions. 22.29/12.14 [2019-03-28 12:02:18,304 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 22.29/12.14 [2019-03-28 12:02:18,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 23 transitions. 22.29/12.14 [2019-03-28 12:02:18,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 22.29/12.14 [2019-03-28 12:02:18,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.29/12.14 [2019-03-28 12:02:18,306 INFO L119 BuchiIsEmpty]: Starting construction of run 22.29/12.14 [2019-03-28 12:02:18,306 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 22.29/12.14 [2019-03-28 12:02:18,306 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 22.29/12.14 [2019-03-28 12:02:18,307 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRY [40] ULTIMATE.startENTRY-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~tk~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) (= v_ULTIMATE.start_main_~k~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, 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~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet4_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet5_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~tk~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~an~0] 26#L29-2 22.29/12.14 [2019-03-28 12:02:18,307 INFO L796 eck$LassoCheckResult]: Loop: 26#L29-2 [60] L29-2-->L19: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= (+ v_ULTIMATE.start_main_~tk~0_5 1) v_ULTIMATE.start_main_~k~0_5) (<= v_ULTIMATE.start_main_~an~0_5 v_ULTIMATE.start_main_~i~0_5)) InVars {ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} OutVars{ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} AuxVars[] AssignedVars[] 27#L19 [49] L19-->L20: Formula: (and (<= v_ULTIMATE.start_main_~j~0_6 v_ULTIMATE.start_main_~bn~0_6) (<= v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~an~0_6)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_6} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_6} AuxVars[] AssignedVars[] 32#L20 [69] L20-->L29-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet6_3|) (= v_ULTIMATE.start_main_~j~0_7 (+ v_ULTIMATE.start_main_~k~0_7 v_ULTIMATE.start_main_~j~0_8)) (= v_ULTIMATE.start_main_~k~0_6 |v_ULTIMATE.start_main_#t~nondet7_3|) (= v_ULTIMATE.start_main_~tk~0_6 v_ULTIMATE.start_main_~k~0_7)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_3|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8} OutVars{ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_6, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_6, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~tk~0, ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7] 26#L29-2 22.29/12.14 [2019-03-28 12:02:18,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:18,307 INFO L82 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 2 times 22.29/12.14 [2019-03-28 12:02:18,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.29/12.14 [2019-03-28 12:02:18,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.29/12.14 [2019-03-28 12:02:18,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:18,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:18,316 INFO L82 PathProgramCache]: Analyzing trace with hash 89039, now seen corresponding path program 1 times 22.29/12.14 [2019-03-28 12:02:18,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.29/12.14 [2019-03-28 12:02:18,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.29/12.14 [2019-03-28 12:02:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:18,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:18,328 INFO L82 PathProgramCache]: Analyzing trace with hash 2174409, now seen corresponding path program 1 times 22.29/12.14 [2019-03-28 12:02:18,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.29/12.14 [2019-03-28 12:02:18,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.29/12.14 [2019-03-28 12:02:18,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:18,406 INFO L216 LassoAnalysis]: Preferences: 22.29/12.14 [2019-03-28 12:02:18,407 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.29/12.14 [2019-03-28 12:02:18,407 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.29/12.14 [2019-03-28 12:02:18,408 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.29/12.14 [2019-03-28 12:02:18,408 INFO L127 ssoRankerPreferences]: Use exernal solver: true 22.29/12.14 [2019-03-28 12:02:18,408 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:18,408 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.29/12.14 [2019-03-28 12:02:18,408 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.29/12.14 [2019-03-28 12:02:18,408 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 22.29/12.14 [2019-03-28 12:02:18,409 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.29/12.14 [2019-03-28 12:02:18,409 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.29/12.14 [2019-03-28 12:02:18,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:18,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:18,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:18,543 INFO L300 LassoAnalysis]: Preprocessing complete. 22.29/12.14 [2019-03-28 12:02:18,544 INFO L412 LassoAnalysis]: Checking for nontermination... 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:18,552 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:18,552 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 [2019-03-28 12:02:18,585 INFO L445 LassoAnalysis]: Proved nontermination for one component. 22.29/12.14 [2019-03-28 12:02:18,586 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet6=1} Honda state: {ULTIMATE.start_main_#t~nondet6=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:18,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:18,593 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:18,627 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:18,628 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 [2019-03-28 12:02:21,115 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 22.29/12.14 [2019-03-28 12:02:21,118 INFO L216 LassoAnalysis]: Preferences: 22.29/12.14 [2019-03-28 12:02:21,119 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.29/12.14 [2019-03-28 12:02:21,119 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.29/12.14 [2019-03-28 12:02:21,119 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.29/12.14 [2019-03-28 12:02:21,119 INFO L127 ssoRankerPreferences]: Use exernal solver: false 22.29/12.14 [2019-03-28 12:02:21,119 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:21,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.29/12.14 [2019-03-28 12:02:21,120 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.29/12.14 [2019-03-28 12:02:21,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 22.29/12.14 [2019-03-28 12:02:21,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.29/12.14 [2019-03-28 12:02:21,120 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.29/12.14 [2019-03-28 12:02:21,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:21,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:21,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:21,204 INFO L300 LassoAnalysis]: Preprocessing complete. 22.29/12.14 [2019-03-28 12:02:21,210 INFO L497 LassoAnalysis]: Using template 'affine'. 22.29/12.14 [2019-03-28 12:02:21,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.29/12.14 Termination analysis: LINEAR_WITH_GUESSES 22.29/12.14 Number of strict supporting invariants: 0 22.29/12.14 Number of non-strict supporting invariants: 1 22.29/12.14 Consider only non-deceasing supporting invariants: true 22.29/12.14 Simplify termination arguments: true 22.29/12.14 Simplify supporting invariants: trueOverapproximate stem: false 22.29/12.14 [2019-03-28 12:02:21,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.29/12.14 [2019-03-28 12:02:21,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.29/12.14 [2019-03-28 12:02:21,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.29/12.14 [2019-03-28 12:02:21,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.29/12.14 [2019-03-28 12:02:21,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.29/12.14 [2019-03-28 12:02:21,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.29/12.14 [2019-03-28 12:02:21,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.29/12.14 [2019-03-28 12:02:21,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.29/12.14 [2019-03-28 12:02:21,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.29/12.14 Termination analysis: LINEAR_WITH_GUESSES 22.29/12.14 Number of strict supporting invariants: 0 22.29/12.14 Number of non-strict supporting invariants: 1 22.29/12.14 Consider only non-deceasing supporting invariants: true 22.29/12.14 Simplify termination arguments: true 22.29/12.14 Simplify supporting invariants: trueOverapproximate stem: false 22.29/12.14 [2019-03-28 12:02:21,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.29/12.14 [2019-03-28 12:02:21,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.29/12.14 [2019-03-28 12:02:21,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.29/12.14 [2019-03-28 12:02:21,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.29/12.14 [2019-03-28 12:02:21,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.29/12.14 [2019-03-28 12:02:21,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.29/12.14 [2019-03-28 12:02:21,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.29/12.14 [2019-03-28 12:02:21,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.29/12.14 [2019-03-28 12:02:21,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.29/12.14 Termination analysis: LINEAR_WITH_GUESSES 22.29/12.14 Number of strict supporting invariants: 0 22.29/12.14 Number of non-strict supporting invariants: 1 22.29/12.14 Consider only non-deceasing supporting invariants: true 22.29/12.14 Simplify termination arguments: true 22.29/12.14 Simplify supporting invariants: trueOverapproximate stem: false 22.29/12.14 [2019-03-28 12:02:21,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.29/12.14 [2019-03-28 12:02:21,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.29/12.14 [2019-03-28 12:02:21,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.29/12.14 [2019-03-28 12:02:21,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.29/12.14 [2019-03-28 12:02:21,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.29/12.14 [2019-03-28 12:02:21,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.29/12.14 [2019-03-28 12:02:21,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.29/12.14 [2019-03-28 12:02:21,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.29/12.14 [2019-03-28 12:02:21,245 INFO L497 LassoAnalysis]: Using template '2-nested'. 22.29/12.14 [2019-03-28 12:02:21,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.29/12.14 Termination analysis: LINEAR_WITH_GUESSES 22.29/12.14 Number of strict supporting invariants: 0 22.29/12.14 Number of non-strict supporting invariants: 1 22.29/12.14 Consider only non-deceasing supporting invariants: true 22.29/12.14 Simplify termination arguments: true 22.29/12.14 Simplify supporting invariants: trueOverapproximate stem: false 22.29/12.14 [2019-03-28 12:02:21,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.29/12.14 [2019-03-28 12:02:21,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.29/12.14 [2019-03-28 12:02:21,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.29/12.14 [2019-03-28 12:02:21,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.29/12.14 [2019-03-28 12:02:21,246 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 22.29/12.14 [2019-03-28 12:02:21,247 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 22.29/12.14 [2019-03-28 12:02:21,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.29/12.14 [2019-03-28 12:02:21,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.29/12.14 [2019-03-28 12:02:21,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.29/12.14 Termination analysis: LINEAR_WITH_GUESSES 22.29/12.14 Number of strict supporting invariants: 0 22.29/12.14 Number of non-strict supporting invariants: 1 22.29/12.14 Consider only non-deceasing supporting invariants: true 22.29/12.14 Simplify termination arguments: true 22.29/12.14 Simplify supporting invariants: trueOverapproximate stem: false 22.29/12.14 [2019-03-28 12:02:21,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.29/12.14 [2019-03-28 12:02:21,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.29/12.14 [2019-03-28 12:02:21,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.29/12.14 [2019-03-28 12:02:21,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.29/12.14 [2019-03-28 12:02:21,254 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 22.29/12.14 [2019-03-28 12:02:21,256 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 22.29/12.14 [2019-03-28 12:02:21,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.29/12.14 [2019-03-28 12:02:21,272 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 22.29/12.14 [2019-03-28 12:02:21,286 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 22.29/12.14 [2019-03-28 12:02:21,286 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. 22.29/12.14 [2019-03-28 12:02:21,288 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 22.29/12.14 [2019-03-28 12:02:21,288 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 22.29/12.14 [2019-03-28 12:02:21,289 INFO L518 LassoAnalysis]: Proved termination. 22.29/12.14 [2019-03-28 12:02:21,289 INFO L520 LassoAnalysis]: Termination argument consisting of: 22.29/12.14 Ranking function 2-nested ranking function: 22.29/12.14 f0 = -2*ULTIMATE.start_main_~tk~0 22.29/12.14 f1 = 2*ULTIMATE.start_main_~bn~0 - 2*ULTIMATE.start_main_~j~0 + 1 22.29/12.14 Supporting invariants [] 22.29/12.14 [2019-03-28 12:02:21,291 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 22.29/12.14 [2019-03-28 12:02:21,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.29/12.14 [2019-03-28 12:02:21,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core 22.29/12.14 [2019-03-28 12:02:21,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.29/12.14 [2019-03-28 12:02:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.29/12.14 [2019-03-28 12:02:21,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core 22.29/12.14 [2019-03-28 12:02:21,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.29/12.14 [2019-03-28 12:02:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.29/12.14 [2019-03-28 12:02:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:21,686 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 22.29/12.14 [2019-03-28 12:02:21,686 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 9 predicates after loop cannibalization 22.29/12.14 [2019-03-28 12:02:21,689 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 22.29/12.14 [2019-03-28 12:02:21,690 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 10 states and 23 transitions. cyclomatic complexity: 15 Second operand 3 states. 22.29/12.14 [2019-03-28 12:02:22,080 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 10 states and 23 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 42 states and 98 transitions. Complement of second has 7 states. 22.29/12.14 [2019-03-28 12:02:22,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 22.29/12.14 [2019-03-28 12:02:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 22.29/12.14 [2019-03-28 12:02:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. 22.29/12.14 [2019-03-28 12:02:22,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 1 letters. Loop has 3 letters. 22.29/12.14 [2019-03-28 12:02:22,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.29/12.14 [2019-03-28 12:02:22,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 4 letters. Loop has 3 letters. 22.29/12.14 [2019-03-28 12:02:22,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.29/12.14 [2019-03-28 12:02:22,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 1 letters. Loop has 6 letters. 22.29/12.14 [2019-03-28 12:02:22,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.29/12.14 [2019-03-28 12:02:22,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 98 transitions. 22.29/12.14 [2019-03-28 12:02:22,098 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 22.29/12.14 [2019-03-28 12:02:22,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 19 states and 45 transitions. 22.29/12.14 [2019-03-28 12:02:22,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 22.29/12.14 [2019-03-28 12:02:22,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 22.29/12.14 [2019-03-28 12:02:22,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 45 transitions. 22.29/12.14 [2019-03-28 12:02:22,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.29/12.14 [2019-03-28 12:02:22,100 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 45 transitions. 22.29/12.14 [2019-03-28 12:02:22,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 45 transitions. 22.29/12.14 [2019-03-28 12:02:22,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. 22.29/12.14 [2019-03-28 12:02:22,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 22.29/12.14 [2019-03-28 12:02:22,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 42 transitions. 22.29/12.14 [2019-03-28 12:02:22,103 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 42 transitions. 22.29/12.14 [2019-03-28 12:02:22,103 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 42 transitions. 22.29/12.14 [2019-03-28 12:02:22,103 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 22.29/12.14 [2019-03-28 12:02:22,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 42 transitions. 22.29/12.14 [2019-03-28 12:02:22,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 22.29/12.14 [2019-03-28 12:02:22,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.29/12.14 [2019-03-28 12:02:22,105 INFO L119 BuchiIsEmpty]: Starting construction of run 22.29/12.14 [2019-03-28 12:02:22,105 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 22.29/12.14 [2019-03-28 12:02:22,105 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 22.29/12.14 [2019-03-28 12:02:22,106 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY [40] ULTIMATE.startENTRY-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~tk~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) (= v_ULTIMATE.start_main_~k~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, 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~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet4_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet5_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~tk~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~an~0] 128#L29-2 [62] L29-2-->L19: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= (+ v_ULTIMATE.start_main_~tk~0_5 1) v_ULTIMATE.start_main_~k~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} OutVars{ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} AuxVars[] AssignedVars[] 135#L19 22.29/12.14 [2019-03-28 12:02:22,106 INFO L796 eck$LassoCheckResult]: Loop: 135#L19 [49] L19-->L20: Formula: (and (<= v_ULTIMATE.start_main_~j~0_6 v_ULTIMATE.start_main_~bn~0_6) (<= v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~an~0_6)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_6} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_6} AuxVars[] AssignedVars[] 142#L20 [54] L20-->L29-2: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) (= v_ULTIMATE.start_main_~i~0_7 (+ v_ULTIMATE.start_main_~i~0_8 1))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~nondet6] 139#L29-2 [60] L29-2-->L19: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= (+ v_ULTIMATE.start_main_~tk~0_5 1) v_ULTIMATE.start_main_~k~0_5) (<= v_ULTIMATE.start_main_~an~0_5 v_ULTIMATE.start_main_~i~0_5)) InVars {ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} OutVars{ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} AuxVars[] AssignedVars[] 135#L19 22.29/12.14 [2019-03-28 12:02:22,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:22,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2263, now seen corresponding path program 1 times 22.29/12.14 [2019-03-28 12:02:22,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.29/12.14 [2019-03-28 12:02:22,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.29/12.14 [2019-03-28 12:02:22,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:22,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:22,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:22,120 INFO L82 PathProgramCache]: Analyzing trace with hash 78614, now seen corresponding path program 1 times 22.29/12.14 [2019-03-28 12:02:22,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.29/12.14 [2019-03-28 12:02:22,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.29/12.14 [2019-03-28 12:02:22,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:22,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:22,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:22,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:22,129 INFO L82 PathProgramCache]: Analyzing trace with hash 67465856, now seen corresponding path program 1 times 22.29/12.14 [2019-03-28 12:02:22,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.29/12.14 [2019-03-28 12:02:22,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.29/12.14 [2019-03-28 12:02:22,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:22,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:22,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:22,178 INFO L216 LassoAnalysis]: Preferences: 22.29/12.14 [2019-03-28 12:02:22,178 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.29/12.14 [2019-03-28 12:02:22,178 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.29/12.14 [2019-03-28 12:02:22,178 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.29/12.14 [2019-03-28 12:02:22,178 INFO L127 ssoRankerPreferences]: Use exernal solver: true 22.29/12.14 [2019-03-28 12:02:22,179 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:22,179 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.29/12.14 [2019-03-28 12:02:22,179 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.29/12.14 [2019-03-28 12:02:22,179 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 22.29/12.14 [2019-03-28 12:02:22,180 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.29/12.14 [2019-03-28 12:02:22,180 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.29/12.14 [2019-03-28 12:02:22,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:22,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:22,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:22,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:22,247 INFO L300 LassoAnalysis]: Preprocessing complete. 22.29/12.14 [2019-03-28 12:02:22,247 INFO L412 LassoAnalysis]: Checking for nontermination... 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:22,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:22,254 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 [2019-03-28 12:02:22,260 INFO L445 LassoAnalysis]: Proved nontermination for one component. 22.29/12.14 [2019-03-28 12:02:22,261 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet6=0} Honda state: {ULTIMATE.start_main_#t~nondet6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:22,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:22,291 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 [2019-03-28 12:02:22,319 INFO L445 LassoAnalysis]: Proved nontermination for one component. 22.29/12.14 [2019-03-28 12:02:22,319 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~bn~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~bn~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:22,325 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:22,325 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:22,357 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:22,358 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 [2019-03-28 12:02:22,747 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 22.29/12.14 [2019-03-28 12:02:22,751 INFO L216 LassoAnalysis]: Preferences: 22.29/12.14 [2019-03-28 12:02:22,751 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.29/12.14 [2019-03-28 12:02:22,751 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.29/12.14 [2019-03-28 12:02:22,751 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.29/12.14 [2019-03-28 12:02:22,751 INFO L127 ssoRankerPreferences]: Use exernal solver: false 22.29/12.14 [2019-03-28 12:02:22,751 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:22,752 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.29/12.14 [2019-03-28 12:02:22,752 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.29/12.14 [2019-03-28 12:02:22,752 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 22.29/12.14 [2019-03-28 12:02:22,752 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.29/12.14 [2019-03-28 12:02:22,752 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.29/12.14 [2019-03-28 12:02:22,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:22,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:22,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:22,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:22,818 INFO L300 LassoAnalysis]: Preprocessing complete. 22.29/12.14 [2019-03-28 12:02:22,818 INFO L497 LassoAnalysis]: Using template 'affine'. 22.29/12.14 [2019-03-28 12:02:22,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.29/12.14 Termination analysis: LINEAR_WITH_GUESSES 22.29/12.14 Number of strict supporting invariants: 0 22.29/12.14 Number of non-strict supporting invariants: 1 22.29/12.14 Consider only non-deceasing supporting invariants: true 22.29/12.14 Simplify termination arguments: true 22.29/12.14 Simplify supporting invariants: trueOverapproximate stem: false 22.29/12.14 [2019-03-28 12:02:22,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.29/12.14 [2019-03-28 12:02:22,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.29/12.14 [2019-03-28 12:02:22,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.29/12.14 [2019-03-28 12:02:22,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.29/12.14 [2019-03-28 12:02:22,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.29/12.14 [2019-03-28 12:02:22,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.29/12.14 [2019-03-28 12:02:22,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.29/12.14 [2019-03-28 12:02:22,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.29/12.14 [2019-03-28 12:02:22,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.29/12.14 Termination analysis: LINEAR_WITH_GUESSES 22.29/12.14 Number of strict supporting invariants: 0 22.29/12.14 Number of non-strict supporting invariants: 1 22.29/12.14 Consider only non-deceasing supporting invariants: true 22.29/12.14 Simplify termination arguments: true 22.29/12.14 Simplify supporting invariants: trueOverapproximate stem: false 22.29/12.14 [2019-03-28 12:02:22,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.29/12.14 [2019-03-28 12:02:22,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.29/12.14 [2019-03-28 12:02:22,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.29/12.14 [2019-03-28 12:02:22,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.29/12.14 [2019-03-28 12:02:22,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.29/12.14 [2019-03-28 12:02:22,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.29/12.14 [2019-03-28 12:02:22,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.29/12.14 [2019-03-28 12:02:22,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.29/12.14 [2019-03-28 12:02:22,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.29/12.14 Termination analysis: LINEAR_WITH_GUESSES 22.29/12.14 Number of strict supporting invariants: 0 22.29/12.14 Number of non-strict supporting invariants: 1 22.29/12.14 Consider only non-deceasing supporting invariants: true 22.29/12.14 Simplify termination arguments: true 22.29/12.14 Simplify supporting invariants: trueOverapproximate stem: false 22.29/12.14 [2019-03-28 12:02:22,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.29/12.14 [2019-03-28 12:02:22,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.29/12.14 [2019-03-28 12:02:22,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.29/12.14 [2019-03-28 12:02:22,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.29/12.14 [2019-03-28 12:02:22,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.29/12.14 [2019-03-28 12:02:22,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.29/12.14 [2019-03-28 12:02:22,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.29/12.14 [2019-03-28 12:02:22,832 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 22.29/12.14 [2019-03-28 12:02:22,834 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 22.29/12.14 [2019-03-28 12:02:22,835 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 22.29/12.14 [2019-03-28 12:02:22,835 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 22.29/12.14 [2019-03-28 12:02:22,835 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 22.29/12.14 [2019-03-28 12:02:22,836 INFO L518 LassoAnalysis]: Proved termination. 22.29/12.14 [2019-03-28 12:02:22,836 INFO L520 LassoAnalysis]: Termination argument consisting of: 22.29/12.14 Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~an~0) = -2*ULTIMATE.start_main_~i~0 + 2*ULTIMATE.start_main_~an~0 + 1 22.29/12.14 Supporting invariants [] 22.29/12.14 [2019-03-28 12:02:22,836 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 22.29/12.14 [2019-03-28 12:02:22,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.29/12.14 [2019-03-28 12:02:22,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core 22.29/12.14 [2019-03-28 12:02:22,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.29/12.14 [2019-03-28 12:02:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.29/12.14 [2019-03-28 12:02:22,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 22.29/12.14 [2019-03-28 12:02:22,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.29/12.14 [2019-03-28 12:02:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.29/12.14 [2019-03-28 12:02:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.29/12.14 [2019-03-28 12:02:22,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 22.29/12.14 [2019-03-28 12:02:22,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.29/12.14 [2019-03-28 12:02:22,946 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 22.29/12.14 [2019-03-28 12:02:22,946 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 22.29/12.14 [2019-03-28 12:02:22,946 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 42 transitions. cyclomatic complexity: 28 Second operand 4 states. 22.29/12.14 [2019-03-28 12:02:23,035 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 42 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 65 states and 141 transitions. Complement of second has 10 states. 22.29/12.14 [2019-03-28 12:02:23,036 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 22.29/12.14 [2019-03-28 12:02:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 22.29/12.14 [2019-03-28 12:02:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. 22.29/12.14 [2019-03-28 12:02:23,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 3 letters. 22.29/12.14 [2019-03-28 12:02:23,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.29/12.14 [2019-03-28 12:02:23,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 5 letters. Loop has 3 letters. 22.29/12.14 [2019-03-28 12:02:23,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.29/12.14 [2019-03-28 12:02:23,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 6 letters. 22.29/12.14 [2019-03-28 12:02:23,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.29/12.14 [2019-03-28 12:02:23,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 141 transitions. 22.29/12.14 [2019-03-28 12:02:23,044 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 22.29/12.14 [2019-03-28 12:02:23,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 17 states and 34 transitions. 22.29/12.14 [2019-03-28 12:02:23,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 22.29/12.14 [2019-03-28 12:02:23,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 22.29/12.14 [2019-03-28 12:02:23,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 34 transitions. 22.29/12.14 [2019-03-28 12:02:23,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.29/12.14 [2019-03-28 12:02:23,045 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 34 transitions. 22.29/12.14 [2019-03-28 12:02:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 34 transitions. 22.29/12.14 [2019-03-28 12:02:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 22.29/12.14 [2019-03-28 12:02:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 22.29/12.14 [2019-03-28 12:02:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 34 transitions. 22.29/12.14 [2019-03-28 12:02:23,048 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 34 transitions. 22.29/12.14 [2019-03-28 12:02:23,048 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 34 transitions. 22.29/12.14 [2019-03-28 12:02:23,048 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 22.29/12.14 [2019-03-28 12:02:23,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 34 transitions. 22.29/12.14 [2019-03-28 12:02:23,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 22.29/12.14 [2019-03-28 12:02:23,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.29/12.14 [2019-03-28 12:02:23,049 INFO L119 BuchiIsEmpty]: Starting construction of run 22.29/12.14 [2019-03-28 12:02:23,049 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 22.29/12.14 [2019-03-28 12:02:23,049 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 22.29/12.14 [2019-03-28 12:02:23,050 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY [40] ULTIMATE.startENTRY-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~tk~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) (= v_ULTIMATE.start_main_~k~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, 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~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet4_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet5_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~tk~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~an~0] 264#L29-2 [60] L29-2-->L19: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= (+ v_ULTIMATE.start_main_~tk~0_5 1) v_ULTIMATE.start_main_~k~0_5) (<= v_ULTIMATE.start_main_~an~0_5 v_ULTIMATE.start_main_~i~0_5)) InVars {ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} OutVars{ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} AuxVars[] AssignedVars[] 272#L19 22.29/12.14 [2019-03-28 12:02:23,050 INFO L796 eck$LassoCheckResult]: Loop: 272#L19 [49] L19-->L20: Formula: (and (<= v_ULTIMATE.start_main_~j~0_6 v_ULTIMATE.start_main_~bn~0_6) (<= v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~an~0_6)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_6} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_6} AuxVars[] AssignedVars[] 276#L20 [54] L20-->L29-2: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) (= v_ULTIMATE.start_main_~i~0_7 (+ v_ULTIMATE.start_main_~i~0_8 1))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~nondet6] 271#L29-2 [60] L29-2-->L19: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= (+ v_ULTIMATE.start_main_~tk~0_5 1) v_ULTIMATE.start_main_~k~0_5) (<= v_ULTIMATE.start_main_~an~0_5 v_ULTIMATE.start_main_~i~0_5)) InVars {ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} OutVars{ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} AuxVars[] AssignedVars[] 272#L19 22.29/12.14 [2019-03-28 12:02:23,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:23,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2261, now seen corresponding path program 1 times 22.29/12.14 [2019-03-28 12:02:23,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.29/12.14 [2019-03-28 12:02:23,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.29/12.14 [2019-03-28 12:02:23,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash 78614, now seen corresponding path program 2 times 22.29/12.14 [2019-03-28 12:02:23,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.29/12.14 [2019-03-28 12:02:23,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.29/12.14 [2019-03-28 12:02:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:23,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:23,068 INFO L82 PathProgramCache]: Analyzing trace with hash 67406274, now seen corresponding path program 1 times 22.29/12.14 [2019-03-28 12:02:23,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.29/12.14 [2019-03-28 12:02:23,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.29/12.14 [2019-03-28 12:02:23,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:23,109 INFO L216 LassoAnalysis]: Preferences: 22.29/12.14 [2019-03-28 12:02:23,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.29/12.14 [2019-03-28 12:02:23,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.29/12.14 [2019-03-28 12:02:23,109 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.29/12.14 [2019-03-28 12:02:23,110 INFO L127 ssoRankerPreferences]: Use exernal solver: true 22.29/12.14 [2019-03-28 12:02:23,110 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:23,110 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.29/12.14 [2019-03-28 12:02:23,110 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.29/12.14 [2019-03-28 12:02:23,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 22.29/12.14 [2019-03-28 12:02:23,110 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.29/12.14 [2019-03-28 12:02:23,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.29/12.14 [2019-03-28 12:02:23,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:23,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:23,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:23,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:23,162 INFO L300 LassoAnalysis]: Preprocessing complete. 22.29/12.14 [2019-03-28 12:02:23,163 INFO L412 LassoAnalysis]: Checking for nontermination... 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:23,167 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:23,168 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 [2019-03-28 12:02:23,171 INFO L445 LassoAnalysis]: Proved nontermination for one component. 22.29/12.14 [2019-03-28 12:02:23,172 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet6=0} Honda state: {ULTIMATE.start_main_#t~nondet6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:23,200 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:23,200 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 [2019-03-28 12:02:23,227 INFO L445 LassoAnalysis]: Proved nontermination for one component. 22.29/12.14 [2019-03-28 12:02:23,227 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~bn~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~bn~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:23,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:23,233 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:23,265 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:23,265 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 [2019-03-28 12:02:23,635 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 22.29/12.14 [2019-03-28 12:02:23,638 INFO L216 LassoAnalysis]: Preferences: 22.29/12.14 [2019-03-28 12:02:23,638 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.29/12.14 [2019-03-28 12:02:23,638 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.29/12.14 [2019-03-28 12:02:23,638 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.29/12.14 [2019-03-28 12:02:23,638 INFO L127 ssoRankerPreferences]: Use exernal solver: false 22.29/12.14 [2019-03-28 12:02:23,638 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:23,639 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.29/12.14 [2019-03-28 12:02:23,639 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.29/12.14 [2019-03-28 12:02:23,639 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 22.29/12.14 [2019-03-28 12:02:23,639 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.29/12.14 [2019-03-28 12:02:23,639 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.29/12.14 [2019-03-28 12:02:23,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:23,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:23,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:23,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:23,683 INFO L300 LassoAnalysis]: Preprocessing complete. 22.29/12.14 [2019-03-28 12:02:23,684 INFO L497 LassoAnalysis]: Using template 'affine'. 22.29/12.14 [2019-03-28 12:02:23,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.29/12.14 Termination analysis: LINEAR_WITH_GUESSES 22.29/12.14 Number of strict supporting invariants: 0 22.29/12.14 Number of non-strict supporting invariants: 1 22.29/12.14 Consider only non-deceasing supporting invariants: true 22.29/12.14 Simplify termination arguments: true 22.29/12.14 Simplify supporting invariants: trueOverapproximate stem: false 22.29/12.14 [2019-03-28 12:02:23,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.29/12.14 [2019-03-28 12:02:23,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.29/12.14 [2019-03-28 12:02:23,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.29/12.14 [2019-03-28 12:02:23,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.29/12.14 [2019-03-28 12:02:23,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.29/12.14 [2019-03-28 12:02:23,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.29/12.14 [2019-03-28 12:02:23,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.29/12.14 [2019-03-28 12:02:23,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.29/12.14 [2019-03-28 12:02:23,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.29/12.14 Termination analysis: LINEAR_WITH_GUESSES 22.29/12.14 Number of strict supporting invariants: 0 22.29/12.14 Number of non-strict supporting invariants: 1 22.29/12.14 Consider only non-deceasing supporting invariants: true 22.29/12.14 Simplify termination arguments: true 22.29/12.14 Simplify supporting invariants: trueOverapproximate stem: false 22.29/12.14 [2019-03-28 12:02:23,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.29/12.14 [2019-03-28 12:02:23,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.29/12.14 [2019-03-28 12:02:23,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.29/12.14 [2019-03-28 12:02:23,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.29/12.14 [2019-03-28 12:02:23,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.29/12.14 [2019-03-28 12:02:23,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.29/12.14 [2019-03-28 12:02:23,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.29/12.14 [2019-03-28 12:02:23,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.29/12.14 [2019-03-28 12:02:23,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.29/12.14 Termination analysis: LINEAR_WITH_GUESSES 22.29/12.14 Number of strict supporting invariants: 0 22.29/12.14 Number of non-strict supporting invariants: 1 22.29/12.14 Consider only non-deceasing supporting invariants: true 22.29/12.14 Simplify termination arguments: true 22.29/12.14 Simplify supporting invariants: trueOverapproximate stem: false 22.29/12.14 [2019-03-28 12:02:23,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.29/12.14 [2019-03-28 12:02:23,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.29/12.14 [2019-03-28 12:02:23,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.29/12.14 [2019-03-28 12:02:23,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.29/12.14 [2019-03-28 12:02:23,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.29/12.14 [2019-03-28 12:02:23,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.29/12.14 [2019-03-28 12:02:23,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.29/12.14 [2019-03-28 12:02:23,695 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 22.29/12.14 [2019-03-28 12:02:23,698 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 22.29/12.14 [2019-03-28 12:02:23,698 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 22.29/12.14 [2019-03-28 12:02:23,698 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 22.29/12.14 [2019-03-28 12:02:23,698 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 22.29/12.14 [2019-03-28 12:02:23,698 INFO L518 LassoAnalysis]: Proved termination. 22.29/12.14 [2019-03-28 12:02:23,699 INFO L520 LassoAnalysis]: Termination argument consisting of: 22.29/12.14 Ranking function f(ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~an~0 - 2*ULTIMATE.start_main_~i~0 + 1 22.29/12.14 Supporting invariants [] 22.29/12.14 [2019-03-28 12:02:23,699 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 22.29/12.14 [2019-03-28 12:02:23,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.29/12.14 [2019-03-28 12:02:23,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core 22.29/12.14 [2019-03-28 12:02:23,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.29/12.14 [2019-03-28 12:02:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.29/12.14 [2019-03-28 12:02:23,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 22.29/12.14 [2019-03-28 12:02:23,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.29/12.14 [2019-03-28 12:02:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.29/12.14 [2019-03-28 12:02:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.29/12.14 [2019-03-28 12:02:23,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 22.29/12.14 [2019-03-28 12:02:23,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.29/12.14 [2019-03-28 12:02:23,766 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 22.29/12.14 [2019-03-28 12:02:23,766 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 22.29/12.14 [2019-03-28 12:02:23,766 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 34 transitions. cyclomatic complexity: 20 Second operand 4 states. 22.29/12.14 [2019-03-28 12:02:23,817 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 34 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 62 states and 114 transitions. Complement of second has 8 states. 22.29/12.14 [2019-03-28 12:02:23,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 22.29/12.14 [2019-03-28 12:02:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 22.29/12.14 [2019-03-28 12:02:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. 22.29/12.14 [2019-03-28 12:02:23,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 2 letters. Loop has 3 letters. 22.29/12.14 [2019-03-28 12:02:23,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.29/12.14 [2019-03-28 12:02:23,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 3 letters. 22.29/12.14 [2019-03-28 12:02:23,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.29/12.14 [2019-03-28 12:02:23,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 2 letters. Loop has 6 letters. 22.29/12.14 [2019-03-28 12:02:23,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.29/12.14 [2019-03-28 12:02:23,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 114 transitions. 22.29/12.14 [2019-03-28 12:02:23,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 22.29/12.14 [2019-03-28 12:02:23,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 17 states and 26 transitions. 22.29/12.14 [2019-03-28 12:02:23,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 22.29/12.14 [2019-03-28 12:02:23,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 22.29/12.14 [2019-03-28 12:02:23,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 26 transitions. 22.29/12.14 [2019-03-28 12:02:23,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.29/12.14 [2019-03-28 12:02:23,825 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. 22.29/12.14 [2019-03-28 12:02:23,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 26 transitions. 22.29/12.14 [2019-03-28 12:02:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 22.29/12.14 [2019-03-28 12:02:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 22.29/12.14 [2019-03-28 12:02:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. 22.29/12.14 [2019-03-28 12:02:23,827 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. 22.29/12.14 [2019-03-28 12:02:23,827 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. 22.29/12.14 [2019-03-28 12:02:23,827 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 22.29/12.14 [2019-03-28 12:02:23,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. 22.29/12.14 [2019-03-28 12:02:23,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 22.29/12.14 [2019-03-28 12:02:23,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.29/12.14 [2019-03-28 12:02:23,828 INFO L119 BuchiIsEmpty]: Starting construction of run 22.29/12.14 [2019-03-28 12:02:23,828 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 22.29/12.14 [2019-03-28 12:02:23,828 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 22.29/12.14 [2019-03-28 12:02:23,829 INFO L794 eck$LassoCheckResult]: Stem: 390#ULTIMATE.startENTRY [40] ULTIMATE.startENTRY-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~tk~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) (= v_ULTIMATE.start_main_~k~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, 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~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet4_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet5_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~tk~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~an~0] 391#L29-2 [61] L29-2-->L19: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_5 v_ULTIMATE.start_main_~j~0_5) (<= (+ v_ULTIMATE.start_main_~tk~0_5 1) v_ULTIMATE.start_main_~k~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} OutVars{ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} AuxVars[] AssignedVars[] 405#L19 22.29/12.14 [2019-03-28 12:02:23,829 INFO L796 eck$LassoCheckResult]: Loop: 405#L19 [68] L19-->L27: Formula: (> v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~bn~0_7) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 392#L27 [45] L27-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_10 (+ v_ULTIMATE.start_main_~i~0_11 1)) (<= v_ULTIMATE.start_main_~bn~0_8 v_ULTIMATE.start_main_~j~0_10) (<= v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~an~0_8)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 394#L29-2 [61] L29-2-->L19: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_5 v_ULTIMATE.start_main_~j~0_5) (<= (+ v_ULTIMATE.start_main_~tk~0_5 1) v_ULTIMATE.start_main_~k~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} OutVars{ULTIMATE.start_main_~tk~0=v_ULTIMATE.start_main_~tk~0_5, ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5} AuxVars[] AssignedVars[] 405#L19 22.29/12.14 [2019-03-28 12:02:23,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:23,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2262, now seen corresponding path program 1 times 22.29/12.14 [2019-03-28 12:02:23,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.29/12.14 [2019-03-28 12:02:23,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.29/12.14 [2019-03-28 12:02:23,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:23,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:23,839 INFO L82 PathProgramCache]: Analyzing trace with hash 96595, now seen corresponding path program 1 times 22.29/12.14 [2019-03-28 12:02:23,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.29/12.14 [2019-03-28 12:02:23,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.29/12.14 [2019-03-28 12:02:23,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash 67454046, now seen corresponding path program 1 times 22.29/12.14 [2019-03-28 12:02:23,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.29/12.14 [2019-03-28 12:02:23,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.29/12.14 [2019-03-28 12:02:23,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.29/12.14 [2019-03-28 12:02:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.29/12.14 [2019-03-28 12:02:23,885 INFO L216 LassoAnalysis]: Preferences: 22.29/12.14 [2019-03-28 12:02:23,885 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.29/12.14 [2019-03-28 12:02:23,885 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.29/12.14 [2019-03-28 12:02:23,885 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.29/12.14 [2019-03-28 12:02:23,886 INFO L127 ssoRankerPreferences]: Use exernal solver: true 22.29/12.14 [2019-03-28 12:02:23,886 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:23,886 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.29/12.14 [2019-03-28 12:02:23,886 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.29/12.14 [2019-03-28 12:02:23,886 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 22.29/12.14 [2019-03-28 12:02:23,886 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.29/12.14 [2019-03-28 12:02:23,886 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.29/12.14 [2019-03-28 12:02:23,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:23,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:23,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:23,921 INFO L300 LassoAnalysis]: Preprocessing complete. 22.29/12.14 [2019-03-28 12:02:23,922 INFO L412 LassoAnalysis]: Checking for nontermination... 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:23,927 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:23,927 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 [2019-03-28 12:02:23,954 INFO L445 LassoAnalysis]: Proved nontermination for one component. 22.29/12.14 [2019-03-28 12:02:23,954 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~bn~0=0} Honda state: {ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~bn~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:23,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:23,961 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 [2019-03-28 12:02:23,988 INFO L445 LassoAnalysis]: Proved nontermination for one component. 22.29/12.14 [2019-03-28 12:02:23,988 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=1, ULTIMATE.start_main_~tk~0=0} Honda state: {ULTIMATE.start_main_~k~0=1, ULTIMATE.start_main_~tk~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:23,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:23,994 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.29/12.14 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.29/12.14 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:24,034 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 22.29/12.14 [2019-03-28 12:02:24,034 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.29/12.14 [2019-03-28 12:02:24,572 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 22.29/12.14 [2019-03-28 12:02:24,574 INFO L216 LassoAnalysis]: Preferences: 22.29/12.14 [2019-03-28 12:02:24,574 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.29/12.14 [2019-03-28 12:02:24,575 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.29/12.14 [2019-03-28 12:02:24,575 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.29/12.14 [2019-03-28 12:02:24,575 INFO L127 ssoRankerPreferences]: Use exernal solver: false 22.29/12.14 [2019-03-28 12:02:24,575 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 22.29/12.14 [2019-03-28 12:02:24,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.29/12.14 [2019-03-28 12:02:24,575 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.29/12.14 [2019-03-28 12:02:24,575 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 22.29/12.14 [2019-03-28 12:02:24,575 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.29/12.14 [2019-03-28 12:02:24,575 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.29/12.14 [2019-03-28 12:02:24,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:24,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:24,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.29/12.14 [2019-03-28 12:02:24,605 INFO L300 LassoAnalysis]: Preprocessing complete. 22.29/12.14 [2019-03-28 12:02:24,605 INFO L497 LassoAnalysis]: Using template 'affine'. 22.29/12.14 [2019-03-28 12:02:24,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.29/12.14 Termination analysis: LINEAR_WITH_GUESSES 22.29/12.14 Number of strict supporting invariants: 0 22.29/12.14 Number of non-strict supporting invariants: 1 22.29/12.14 Consider only non-deceasing supporting invariants: true 22.29/12.14 Simplify termination arguments: true 22.29/12.14 Simplify supporting invariants: trueOverapproximate stem: false 22.29/12.14 [2019-03-28 12:02:24,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.29/12.14 [2019-03-28 12:02:24,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.29/12.14 [2019-03-28 12:02:24,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.29/12.14 [2019-03-28 12:02:24,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.29/12.14 [2019-03-28 12:02:24,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.29/12.14 [2019-03-28 12:02:24,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.29/12.14 [2019-03-28 12:02:24,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.29/12.14 [2019-03-28 12:02:24,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.29/12.14 [2019-03-28 12:02:24,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.29/12.14 Termination analysis: LINEAR_WITH_GUESSES 22.29/12.14 Number of strict supporting invariants: 0 22.29/12.14 Number of non-strict supporting invariants: 1 22.29/12.14 Consider only non-deceasing supporting invariants: true 22.29/12.14 Simplify termination arguments: true 22.29/12.14 Simplify supporting invariants: trueOverapproximate stem: false 22.29/12.14 [2019-03-28 12:02:24,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.29/12.14 [2019-03-28 12:02:24,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.29/12.14 [2019-03-28 12:02:24,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.29/12.14 [2019-03-28 12:02:24,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.29/12.14 [2019-03-28 12:02:24,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.29/12.14 [2019-03-28 12:02:24,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.29/12.14 [2019-03-28 12:02:24,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.29/12.14 [2019-03-28 12:02:24,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.29/12.14 [2019-03-28 12:02:24,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.29/12.14 Termination analysis: LINEAR_WITH_GUESSES 22.29/12.14 Number of strict supporting invariants: 0 22.29/12.14 Number of non-strict supporting invariants: 1 22.29/12.14 Consider only non-deceasing supporting invariants: true 22.29/12.14 Simplify termination arguments: true 22.29/12.14 Simplify supporting invariants: trueOverapproximate stem: false 22.29/12.14 [2019-03-28 12:02:24,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.29/12.14 [2019-03-28 12:02:24,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.29/12.14 [2019-03-28 12:02:24,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.29/12.14 [2019-03-28 12:02:24,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.29/12.14 [2019-03-28 12:02:24,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.29/12.14 [2019-03-28 12:02:24,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.29/12.14 [2019-03-28 12:02:24,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.29/12.14 [2019-03-28 12:02:24,616 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 22.29/12.14 [2019-03-28 12:02:24,618 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 22.29/12.14 [2019-03-28 12:02:24,618 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 22.29/12.14 [2019-03-28 12:02:24,619 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 22.29/12.14 [2019-03-28 12:02:24,619 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 22.29/12.14 [2019-03-28 12:02:24,619 INFO L518 LassoAnalysis]: Proved termination. 22.29/12.14 [2019-03-28 12:02:24,619 INFO L520 LassoAnalysis]: Termination argument consisting of: 22.29/12.14 Ranking function f(ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~an~0 - 1*ULTIMATE.start_main_~i~0 22.29/12.14 Supporting invariants [] 22.29/12.14 [2019-03-28 12:02:24,620 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 22.29/12.14 [2019-03-28 12:02:24,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.29/12.14 [2019-03-28 12:02:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.29/12.14 [2019-03-28 12:02:24,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core 22.29/12.14 [2019-03-28 12:02:24,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.29/12.14 [2019-03-28 12:02:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.29/12.14 [2019-03-28 12:02:24,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 22.29/12.14 [2019-03-28 12:02:24,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.29/12.14 [2019-03-28 12:02:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.29/12.14 [2019-03-28 12:02:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.29/12.14 [2019-03-28 12:02:24,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 22.29/12.14 [2019-03-28 12:02:24,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.29/12.14 [2019-03-28 12:02:24,680 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 22.29/12.14 [2019-03-28 12:02:24,680 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 22.29/12.14 [2019-03-28 12:02:24,680 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 26 transitions. cyclomatic complexity: 12 Second operand 4 states. 22.29/12.14 [2019-03-28 12:02:24,730 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 26 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 41 states and 66 transitions. Complement of second has 8 states. 22.29/12.14 [2019-03-28 12:02:24,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states 22.29/12.14 [2019-03-28 12:02:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 22.29/12.14 [2019-03-28 12:02:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. 22.29/12.14 [2019-03-28 12:02:24,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 2 letters. Loop has 3 letters. 22.29/12.14 [2019-03-28 12:02:24,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.29/12.14 [2019-03-28 12:02:24,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 3 letters. 22.29/12.14 [2019-03-28 12:02:24,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.29/12.14 [2019-03-28 12:02:24,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 2 letters. Loop has 6 letters. 22.29/12.14 [2019-03-28 12:02:24,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.29/12.14 [2019-03-28 12:02:24,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 66 transitions. 22.29/12.14 [2019-03-28 12:02:24,735 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 22.29/12.14 [2019-03-28 12:02:24,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. 22.29/12.14 [2019-03-28 12:02:24,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 22.29/12.14 [2019-03-28 12:02:24,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 22.29/12.14 [2019-03-28 12:02:24,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 22.29/12.14 [2019-03-28 12:02:24,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 22.29/12.14 [2019-03-28 12:02:24,736 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 22.29/12.14 [2019-03-28 12:02:24,736 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 22.29/12.14 [2019-03-28 12:02:24,736 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 22.29/12.14 [2019-03-28 12:02:24,736 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 22.29/12.14 [2019-03-28 12:02:24,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 22.29/12.14 [2019-03-28 12:02:24,736 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 22.29/12.14 [2019-03-28 12:02:24,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 22.29/12.14 [2019-03-28 12:02:24,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:02:24 BasicIcfg 22.29/12.14 [2019-03-28 12:02:24,742 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 22.29/12.14 [2019-03-28 12:02:24,743 INFO L168 Benchmark]: Toolchain (without parser) took 7606.04 ms. Allocated memory was 649.6 MB in the beginning and 737.7 MB in the end (delta: 88.1 MB). Free memory was 565.9 MB in the beginning and 531.7 MB in the end (delta: 34.3 MB). Peak memory consumption was 122.4 MB. Max. memory is 50.3 GB. 22.29/12.14 [2019-03-28 12:02:24,745 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 22.29/12.14 [2019-03-28 12:02:24,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.01 ms. Allocated memory is still 649.6 MB. Free memory was 565.9 MB in the beginning and 556.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 50.3 GB. 22.29/12.14 [2019-03-28 12:02:24,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.54 ms. Allocated memory was 649.6 MB in the beginning and 658.5 MB in the end (delta: 8.9 MB). Free memory was 555.0 MB in the beginning and 625.4 MB in the end (delta: -70.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. 22.29/12.14 [2019-03-28 12:02:24,746 INFO L168 Benchmark]: Boogie Preprocessor took 20.56 ms. Allocated memory is still 658.5 MB. Free memory was 625.4 MB in the beginning and 622.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 22.29/12.14 [2019-03-28 12:02:24,747 INFO L168 Benchmark]: RCFGBuilder took 227.03 ms. Allocated memory is still 658.5 MB. Free memory was 622.5 MB in the beginning and 606.9 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 50.3 GB. 22.29/12.14 [2019-03-28 12:02:24,747 INFO L168 Benchmark]: BlockEncodingV2 took 84.09 ms. Allocated memory is still 658.5 MB. Free memory was 606.9 MB in the beginning and 600.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. 22.29/12.14 [2019-03-28 12:02:24,748 INFO L168 Benchmark]: TraceAbstraction took 162.92 ms. Allocated memory is still 658.5 MB. Free memory was 599.1 MB in the beginning and 590.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. 22.29/12.14 [2019-03-28 12:02:24,748 INFO L168 Benchmark]: BuchiAutomizer took 6781.52 ms. Allocated memory was 658.5 MB in the beginning and 737.7 MB in the end (delta: 79.2 MB). Free memory was 590.3 MB in the beginning and 531.7 MB in the end (delta: 58.7 MB). Peak memory consumption was 137.8 MB. Max. memory is 50.3 GB. 22.29/12.14 [2019-03-28 12:02:24,753 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 22.29/12.14 --- Results --- 22.29/12.14 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 22.29/12.14 - StatisticsResult: Initial Icfg 22.29/12.14 10 locations, 15 edges 22.29/12.14 - StatisticsResult: Encoded RCFG 22.29/12.14 6 locations, 16 edges 22.29/12.14 * Results from de.uni_freiburg.informatik.ultimate.core: 22.29/12.14 - StatisticsResult: Toolchain Benchmarks 22.29/12.14 Benchmark results are: 22.29/12.14 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 22.29/12.14 * CACSL2BoogieTranslator took 234.01 ms. Allocated memory is still 649.6 MB. Free memory was 565.9 MB in the beginning and 556.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 50.3 GB. 22.29/12.14 * Boogie Procedure Inliner took 89.54 ms. Allocated memory was 649.6 MB in the beginning and 658.5 MB in the end (delta: 8.9 MB). Free memory was 555.0 MB in the beginning and 625.4 MB in the end (delta: -70.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. 22.29/12.14 * Boogie Preprocessor took 20.56 ms. Allocated memory is still 658.5 MB. Free memory was 625.4 MB in the beginning and 622.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 22.29/12.14 * RCFGBuilder took 227.03 ms. Allocated memory is still 658.5 MB. Free memory was 622.5 MB in the beginning and 606.9 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 50.3 GB. 22.29/12.14 * BlockEncodingV2 took 84.09 ms. Allocated memory is still 658.5 MB. Free memory was 606.9 MB in the beginning and 600.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. 22.29/12.14 * TraceAbstraction took 162.92 ms. Allocated memory is still 658.5 MB. Free memory was 599.1 MB in the beginning and 590.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. 22.29/12.14 * BuchiAutomizer took 6781.52 ms. Allocated memory was 658.5 MB in the beginning and 737.7 MB in the end (delta: 79.2 MB). Free memory was 590.3 MB in the beginning and 531.7 MB in the end (delta: 58.7 MB). Peak memory consumption was 137.8 MB. Max. memory is 50.3 GB. 22.29/12.14 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 22.29/12.14 - AllSpecificationsHoldResult: All specifications hold 22.29/12.14 We were not able to verify any specifiation because the program does not contain any specification. 22.29/12.14 - InvariantResult [Line: 18]: Loop Invariant 22.29/12.14 Derived loop invariant: 1 22.29/12.14 - StatisticsResult: Ultimate Automizer benchmark data 22.29/12.14 CFG has 1 procedures, 6 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=6occurred 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 22.29/12.14 - StatisticsResult: Constructed decomposition of program 22.29/12.14 Your program was decomposed into 5 terminating modules (1 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has 2-nested ranking function (if -2 * tk > 0 then 1 else 0), (if -2 * tk > 0 then -2 * tk else 2 * bn + -2 * j + 1) and consists of 5 locations. One nondeterministic module has affine ranking function -2 * i + 2 * an + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * an + -2 * i + 1 and consists of 4 locations. One nondeterministic module has affine ranking function an + -1 * i and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. 22.29/12.14 - StatisticsResult: Timing statistics 22.29/12.14 BüchiAutomizer plugin needed 6.7s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 5.3s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 25 SDtfs, 218 SDslu, 27 SDs, 0 SdLazy, 195 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf100 lsp58 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf93 smp100 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 3 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.1s 22.29/12.14 - TerminationAnalysisResult: Termination proven 22.29/12.14 Buchi Automizer proved that your program is terminating 22.29/12.14 RESULT: Ultimate proved your program to be correct! 22.29/12.14 !SESSION 2019-03-28 12:02:13.864 ----------------------------------------------- 22.29/12.14 eclipse.buildId=unknown 22.29/12.14 java.version=1.8.0_181 22.29/12.14 java.vendor=Oracle Corporation 22.29/12.14 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 22.29/12.14 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 22.29/12.14 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 22.29/12.14 22.29/12.14 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:02:24.985 22.29/12.14 !MESSAGE The workspace will exit with unsaved changes in this session. 22.29/12.14 Received shutdown request... 22.29/12.14 Ultimate: 22.29/12.14 GTK+ Version Check 22.29/12.14 EOF