./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/reducercommutativity/avg_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/avg_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 704389633f786b8f459e07240134137dbbeaeb7e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:08:34,519 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:34,521 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:34,531 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:34,532 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:34,532 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:34,533 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:34,536 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:34,537 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:34,538 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:34,539 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:34,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:34,540 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:34,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:34,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:34,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:34,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:34,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:34,548 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:34,550 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:34,551 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:34,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:34,555 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:34,556 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:34,556 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:34,557 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:34,558 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:34,559 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:34,560 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:34,561 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:34,561 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:34,563 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:34,563 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:34,563 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:34,564 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:34,565 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:34,565 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:08:34,581 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:34,581 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:34,583 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:08:34,583 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:08:34,583 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:08:34,583 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:08:34,584 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:08:34,584 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:08:34,584 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:08:34,584 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:08:34,584 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:08:34,585 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:34,585 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:08:34,585 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:08:34,585 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:34,585 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:08:34,586 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:34,586 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:08:34,588 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:08:34,588 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:08:34,588 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:08:34,588 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:34,589 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:08:34,589 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:08:34,589 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:34,589 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:34,589 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:08:34,590 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:34,590 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:08:34,590 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:08:34,591 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:08:34,591 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 704389633f786b8f459e07240134137dbbeaeb7e [2018-10-27 06:08:34,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:34,637 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:34,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:34,643 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:34,643 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:34,644 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/avg_true-unreach-call_true-termination.i [2018-10-27 06:08:34,715 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/data/8f62a707d/3fd12861e7e742d688c3ab2d07065a0e/FLAGff3b4e2a5 [2018-10-27 06:08:35,114 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:35,115 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/sv-benchmarks/c/reducercommutativity/avg_true-unreach-call_true-termination.i [2018-10-27 06:08:35,123 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/data/8f62a707d/3fd12861e7e742d688c3ab2d07065a0e/FLAGff3b4e2a5 [2018-10-27 06:08:35,136 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/data/8f62a707d/3fd12861e7e742d688c3ab2d07065a0e [2018-10-27 06:08:35,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:35,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:08:35,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:35,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:35,145 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:35,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:35" (1/1) ... [2018-10-27 06:08:35,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35875b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:35, skipping insertion in model container [2018-10-27 06:08:35,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:35" (1/1) ... [2018-10-27 06:08:35,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:35,182 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:35,335 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:35,344 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:35,365 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:35,381 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:35,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:35 WrapperNode [2018-10-27 06:08:35,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:35,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:35,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:35,383 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:35,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:35" (1/1) ... [2018-10-27 06:08:35,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:35" (1/1) ... [2018-10-27 06:08:35,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:35,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:35,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:35,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:35,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:35" (1/1) ... [2018-10-27 06:08:35,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:35" (1/1) ... [2018-10-27 06:08:35,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:35" (1/1) ... [2018-10-27 06:08:35,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:35" (1/1) ... [2018-10-27 06:08:35,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:35" (1/1) ... [2018-10-27 06:08:35,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:35" (1/1) ... [2018-10-27 06:08:35,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:35" (1/1) ... [2018-10-27 06:08:35,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:35,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:35,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:35,460 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:35,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:35,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:08:35,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:35,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:35,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:08:36,137 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:36,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:36 BoogieIcfgContainer [2018-10-27 06:08:36,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:36,138 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:08:36,138 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:08:36,142 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:08:36,143 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:36,143 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:08:35" (1/3) ... [2018-10-27 06:08:36,145 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d7f3623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:36, skipping insertion in model container [2018-10-27 06:08:36,145 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:36,145 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:35" (2/3) ... [2018-10-27 06:08:36,145 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d7f3623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:36, skipping insertion in model container [2018-10-27 06:08:36,146 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:36,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:36" (3/3) ... [2018-10-27 06:08:36,148 INFO L375 chiAutomizerObserver]: Analyzing ICFG avg_true-unreach-call_true-termination.i [2018-10-27 06:08:36,209 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:08:36,209 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:08:36,210 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:08:36,210 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:08:36,210 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:36,210 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:36,210 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:08:36,210 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:36,210 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:08:36,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2018-10-27 06:08:36,253 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:08:36,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:36,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:36,261 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-10-27 06:08:36,261 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:36,261 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:08:36,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2018-10-27 06:08:36,265 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:08:36,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:36,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:36,265 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-10-27 06:08:36,266 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:36,274 INFO L793 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 13#L20true assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 8#L11-4true [2018-10-27 06:08:36,275 INFO L795 eck$LassoCheckResult]: Loop: 8#L11-4true assume true; 44#L11-1true assume !!(avg_~i~0 < ~N~0); 20#L12true SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12 18#L12-1true avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 11#L11-3true avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 8#L11-4true [2018-10-27 06:08:36,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,281 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-10-27 06:08:36,283 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:36,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:36,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:36,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,430 INFO L82 PathProgramCache]: Analyzing trace with hash 37372843, now seen corresponding path program 1 times [2018-10-27 06:08:36,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:36,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:36,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:36,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,458 INFO L82 PathProgramCache]: Analyzing trace with hash 119442346, now seen corresponding path program 1 times [2018-10-27 06:08:36,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:36,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:36,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:36,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,928 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-27 06:08:36,989 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:36,991 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:36,991 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:36,991 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:36,991 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:36,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:36,998 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:36,998 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:36,998 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-10-27 06:08:36,998 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:36,998 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:37,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,514 WARN L179 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-10-27 06:08:37,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:37,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:38,146 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:38,151 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:38,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:38,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:38,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:38,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:38,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:38,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:38,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:38,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:38,166 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:38,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:38,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:38,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:38,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:38,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:38,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:38,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:38,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:38,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:38,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:38,184 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:38,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:38,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:38,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:38,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:38,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:38,247 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:38,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,249 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:38,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,253 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:38,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:38,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:38,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:38,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:38,371 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:38,422 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:08:38,423 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:08:38,425 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:38,427 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:38,428 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:38,428 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~x.offset, v_rep(select #length ULTIMATE.start_avg_~x.base)_1, ULTIMATE.start_avg_~i~0) = -1*ULTIMATE.start_avg_~x.offset + 1*v_rep(select #length ULTIMATE.start_avg_~x.base)_1 - 4*ULTIMATE.start_avg_~i~0 Supporting invariants [] [2018-10-27 06:08:38,466 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:08:38,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:08:38,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:38,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:38,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:38,614 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:08:38,615 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states. Second operand 4 states. [2018-10-27 06:08:38,731 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states.. Second operand 4 states. Result 104 states and 120 transitions. Complement of second has 8 states. [2018-10-27 06:08:38,742 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 [2018-10-27 06:08:38,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-10-27 06:08:38,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 3 letters. Loop has 5 letters. [2018-10-27 06:08:38,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:38,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 8 letters. Loop has 5 letters. [2018-10-27 06:08:38,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:38,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 3 letters. Loop has 10 letters. [2018-10-27 06:08:38,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:38,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 120 transitions. [2018-10-27 06:08:38,756 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:08:38,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 41 states and 47 transitions. [2018-10-27 06:08:38,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-10-27 06:08:38,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-10-27 06:08:38,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2018-10-27 06:08:38,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:38,763 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-10-27 06:08:38,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2018-10-27 06:08:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-27 06:08:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-27 06:08:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-10-27 06:08:38,789 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-10-27 06:08:38,789 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-10-27 06:08:38,789 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:08:38,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2018-10-27 06:08:38,792 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:08:38,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:38,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:38,793 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:38,793 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:38,794 INFO L793 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 230#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 229#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 221#L11-4 assume true; 223#L11-1 assume !(avg_~i~0 < ~N~0); 218#L11-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 219#L14 main_#t~ret3 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3; 225#L29 SUMMARY for call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 220#L29-1 main_~temp~0 := main_#t~mem4;havoc main_#t~mem4; 217#L29-2 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 215#L29-3 SUMMARY for call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 216#L29-4 havoc main_#t~mem5; 245#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 242#L29-6 assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 239#L11-10 [2018-10-27 06:08:38,794 INFO L795 eck$LassoCheckResult]: Loop: 239#L11-10 assume true; 240#L11-7 assume !!(avg_~i~0 < ~N~0); 234#L12-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12-2 235#L12-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 243#L11-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 239#L11-10 [2018-10-27 06:08:38,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:38,794 INFO L82 PathProgramCache]: Analyzing trace with hash -533301643, now seen corresponding path program 1 times [2018-10-27 06:08:38,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:38,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:38,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:38,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,814 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:08:38,814 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:08:38,815 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:08:38,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:38,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:38,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:38,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:08:38,909 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:38,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:38,909 INFO L82 PathProgramCache]: Analyzing trace with hash 62184773, now seen corresponding path program 1 times [2018-10-27 06:08:38,909 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:38,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:38,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:38,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:08:39,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:39,074 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-10-27 06:08:39,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:39,175 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-10-27 06:08:39,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:08:39,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 49 transitions. [2018-10-27 06:08:39,178 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:08:39,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 48 transitions. [2018-10-27 06:08:39,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-10-27 06:08:39,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-10-27 06:08:39,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 48 transitions. [2018-10-27 06:08:39,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:39,180 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-10-27 06:08:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 48 transitions. [2018-10-27 06:08:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-10-27 06:08:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-27 06:08:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-10-27 06:08:39,184 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-10-27 06:08:39,184 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-10-27 06:08:39,184 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:39,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 44 transitions. [2018-10-27 06:08:39,185 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:08:39,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:39,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:39,187 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:39,187 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:39,187 INFO L793 eck$LassoCheckResult]: Stem: 387#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 365#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 361#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 353#L11-4 assume true; 354#L11-1 assume !!(avg_~i~0 < ~N~0); 373#L12 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12 370#L12-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 358#L11-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 355#L11-4 assume true; 356#L11-1 assume !(avg_~i~0 < ~N~0); 350#L11-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 351#L14 main_#t~ret3 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3; 357#L29 SUMMARY for call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 352#L29-1 main_~temp~0 := main_#t~mem4;havoc main_#t~mem4; 349#L29-2 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 347#L29-3 SUMMARY for call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 348#L29-4 havoc main_#t~mem5; 377#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 374#L29-6 assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 371#L11-10 [2018-10-27 06:08:39,187 INFO L795 eck$LassoCheckResult]: Loop: 371#L11-10 assume true; 372#L11-7 assume !!(avg_~i~0 < ~N~0); 366#L12-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12-2 367#L12-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 375#L11-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 371#L11-10 [2018-10-27 06:08:39,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:39,188 INFO L82 PathProgramCache]: Analyzing trace with hash 230763117, now seen corresponding path program 1 times [2018-10-27 06:08:39,188 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:39,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:39,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:39,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,206 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:08:39,206 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:08:39,210 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:08:39,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:39,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:39,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:08:39,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-27 06:08:39,401 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:39,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:39,401 INFO L82 PathProgramCache]: Analyzing trace with hash 62184773, now seen corresponding path program 2 times [2018-10-27 06:08:39,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:39,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:39,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:39,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:08:39,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:08:39,479 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-10-27 06:08:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:39,564 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-10-27 06:08:39,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:08:39,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 54 transitions. [2018-10-27 06:08:39,565 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:08:39,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 50 states and 53 transitions. [2018-10-27 06:08:39,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-10-27 06:08:39,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-10-27 06:08:39,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 53 transitions. [2018-10-27 06:08:39,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:39,567 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-10-27 06:08:39,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 53 transitions. [2018-10-27 06:08:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-10-27 06:08:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-27 06:08:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-10-27 06:08:39,570 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-10-27 06:08:39,570 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-10-27 06:08:39,573 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:39,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 49 transitions. [2018-10-27 06:08:39,574 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:08:39,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:39,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:39,575 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:39,575 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:39,576 INFO L793 eck$LassoCheckResult]: Stem: 541#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 515#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 514#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 506#L11-4 assume true; 507#L11-1 assume !!(avg_~i~0 < ~N~0); 545#L12 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12 544#L12-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 511#L11-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 508#L11-4 assume true; 509#L11-1 assume !!(avg_~i~0 < ~N~0); 527#L12 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12 523#L12-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 524#L11-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 543#L11-4 assume true; 540#L11-1 assume !(avg_~i~0 < ~N~0); 503#L11-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 504#L14 main_#t~ret3 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3; 510#L29 SUMMARY for call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 505#L29-1 main_~temp~0 := main_#t~mem4;havoc main_#t~mem4; 502#L29-2 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 500#L29-3 SUMMARY for call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 501#L29-4 havoc main_#t~mem5; 531#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 528#L29-6 assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 525#L11-10 [2018-10-27 06:08:39,576 INFO L795 eck$LassoCheckResult]: Loop: 525#L11-10 assume true; 526#L11-7 assume !!(avg_~i~0 < ~N~0); 519#L12-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12-2 520#L12-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 529#L11-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 525#L11-10 [2018-10-27 06:08:39,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:39,576 INFO L82 PathProgramCache]: Analyzing trace with hash -517983883, now seen corresponding path program 2 times [2018-10-27 06:08:39,576 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:39,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:39,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:39,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,584 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:08:39,584 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:08:39,585 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:08:39,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:08:39,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:08:39,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-10-27 06:08:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:39,712 INFO L82 PathProgramCache]: Analyzing trace with hash 62184773, now seen corresponding path program 3 times [2018-10-27 06:08:39,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:39,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:39,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:39,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:39,723 INFO L82 PathProgramCache]: Analyzing trace with hash 972911697, now seen corresponding path program 1 times [2018-10-27 06:08:39,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:39,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:39,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:39,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,728 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:08:39,728 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:08:39,729 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:08:39,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-10-27 06:08:39,923 INFO L285 seRefinementStrategy]: Strategy CamelRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-10-27 06:08:40,119 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:08:41,168 WARN L179 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 153 DAG size of output: 133 [2018-10-27 06:08:43,499 WARN L179 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2018-10-27 06:08:43,517 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:43,518 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:43,518 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:43,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:43,518 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:43,518 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:43,518 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:43,518 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:43,518 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration4_Lasso [2018-10-27 06:08:43,518 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:43,518 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:43,524 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:08:43,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:43,685 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 29 [2018-10-27 06:08:44,757 WARN L179 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2018-10-27 06:08:44,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:44,837 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:08:45,615 WARN L179 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 101 [2018-10-27 06:08:45,737 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-10-27 06:08:47,314 WARN L179 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 125 DAG size of output: 92 [2018-10-27 06:08:47,395 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:47,395 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:47,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:47,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:47,397 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:47,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:47,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:47,402 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:47,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:47,414 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:47,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:47,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:47,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:47,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:47,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:47,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:47,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:47,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:47,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:47,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:47,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:47,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:47,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:47,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:47,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:47,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:47,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:47,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:47,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:47,426 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-10-27 06:08:47,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:47,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:47,440 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-10-27 06:08:47,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:47,514 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:47,545 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:47,546 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:47,547 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:47,548 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:47,548 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:47,548 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~i~0, ~N~0) = -1*ULTIMATE.start_avg_~i~0 + 1*~N~0 Supporting invariants [] [2018-10-27 06:08:47,686 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-10-27 06:08:47,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:48,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:48,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:48,023 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:08:48,023 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 49 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-10-27 06:08:48,060 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 49 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 63 states and 68 transitions. Complement of second has 7 states. [2018-10-27 06:08:48,062 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 [2018-10-27 06:08:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-10-27 06:08:48,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 24 letters. Loop has 5 letters. [2018-10-27 06:08:48,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:48,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 29 letters. Loop has 5 letters. [2018-10-27 06:08:48,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:48,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 24 letters. Loop has 10 letters. [2018-10-27 06:08:48,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:48,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 68 transitions. [2018-10-27 06:08:48,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-10-27 06:08:48,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 48 states and 52 transitions. [2018-10-27 06:08:48,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-10-27 06:08:48,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-10-27 06:08:48,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 52 transitions. [2018-10-27 06:08:48,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:48,067 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-10-27 06:08:48,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 52 transitions. [2018-10-27 06:08:48,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-27 06:08:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-27 06:08:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-10-27 06:08:48,069 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-10-27 06:08:48,069 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-10-27 06:08:48,070 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:08:48,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 52 transitions. [2018-10-27 06:08:48,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-10-27 06:08:48,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:48,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:48,075 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:48,075 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:48,076 INFO L793 eck$LassoCheckResult]: Stem: 783#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 758#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 754#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 746#L11-4 assume true; 747#L11-1 assume !!(avg_~i~0 < ~N~0); 768#L12 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12 763#L12-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 751#L11-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 748#L11-4 assume true; 749#L11-1 assume !!(avg_~i~0 < ~N~0); 787#L12 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12 786#L12-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 785#L11-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 784#L11-4 assume true; 781#L11-1 assume !(avg_~i~0 < ~N~0); 743#L11-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 744#L14 main_#t~ret3 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3; 750#L29 SUMMARY for call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 745#L29-1 main_~temp~0 := main_#t~mem4;havoc main_#t~mem4; 742#L29-2 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 740#L29-3 SUMMARY for call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 741#L29-4 havoc main_#t~mem5; 772#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 769#L29-6 assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 764#L11-10 assume true; 766#L11-7 assume !(avg_~i~0 < ~N~0); 761#L11-11 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 762#L14-1 main_#t~ret6 := avg_#res;assume { :end_inline_avg } true;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6; 771#L31 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L31 752#L31-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 753#L32-4 [2018-10-27 06:08:48,076 INFO L795 eck$LassoCheckResult]: Loop: 753#L32-4 assume true; 755#L32-1 assume !!(main_~i~1 < ~N~0 - 1); 757#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L33 782#L33-1 SUMMARY for call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L33-1 780#L33-2 havoc main_#t~mem9; 778#L32-3 main_#t~post8 := main_~i~1;main_~i~1 := main_#t~post8 + 1;havoc main_#t~post8; 753#L32-4 [2018-10-27 06:08:48,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:48,076 INFO L82 PathProgramCache]: Analyzing trace with hash 93860987, now seen corresponding path program 1 times [2018-10-27 06:08:48,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:48,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:48,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:48,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:48,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:48,089 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:08:48,089 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:08:48,089 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:08:48,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:48,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 06:08:48,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:48,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:08:48,172 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:48,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1745986743, now seen corresponding path program 1 times [2018-10-27 06:08:48,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:48,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:48,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:48,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:48,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:48,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:08:48,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:08:48,228 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-10-27 06:08:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:48,267 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-10-27 06:08:48,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:08:48,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 61 transitions. [2018-10-27 06:08:48,269 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-10-27 06:08:48,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 60 transitions. [2018-10-27 06:08:48,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-10-27 06:08:48,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-10-27 06:08:48,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 60 transitions. [2018-10-27 06:08:48,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:48,270 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-10-27 06:08:48,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 60 transitions. [2018-10-27 06:08:48,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2018-10-27 06:08:48,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-27 06:08:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-10-27 06:08:48,272 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-10-27 06:08:48,272 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-10-27 06:08:48,273 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:08:48,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 51 transitions. [2018-10-27 06:08:48,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-10-27 06:08:48,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:48,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:48,278 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:48,278 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:48,279 INFO L793 eck$LassoCheckResult]: Stem: 983#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 958#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 954#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 946#L11-4 assume true; 947#L11-1 assume !!(avg_~i~0 < ~N~0); 968#L12 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12 963#L12-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 951#L11-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 948#L11-4 assume true; 949#L11-1 assume !!(avg_~i~0 < ~N~0); 987#L12 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12 986#L12-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 985#L11-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 984#L11-4 assume true; 981#L11-1 assume !(avg_~i~0 < ~N~0); 943#L11-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 944#L14 main_#t~ret3 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3; 950#L29 SUMMARY for call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 945#L29-1 main_~temp~0 := main_#t~mem4;havoc main_#t~mem4; 942#L29-2 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 940#L29-3 SUMMARY for call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 941#L29-4 havoc main_#t~mem5; 972#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 969#L29-6 assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 964#L11-10 assume true; 965#L11-7 assume !!(avg_~i~0 < ~N~0); 959#L12-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12-2 960#L12-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 970#L11-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 966#L11-10 assume true; 967#L11-7 assume !(avg_~i~0 < ~N~0); 961#L11-11 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 962#L14-1 main_#t~ret6 := avg_#res;assume { :end_inline_avg } true;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6; 971#L31 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L31 952#L31-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 953#L32-4 [2018-10-27 06:08:48,279 INFO L795 eck$LassoCheckResult]: Loop: 953#L32-4 assume true; 955#L32-1 assume !!(main_~i~1 < ~N~0 - 1); 957#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L33 982#L33-1 SUMMARY for call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L33-1 980#L33-2 havoc main_#t~mem9; 978#L32-3 main_#t~post8 := main_~i~1;main_~i~1 := main_#t~post8 + 1;havoc main_#t~post8; 953#L32-4 [2018-10-27 06:08:48,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:48,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1440146007, now seen corresponding path program 1 times [2018-10-27 06:08:48,279 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:48,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:48,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:48,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:48,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:48,283 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:08:48,283 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:08:48,284 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:08:48,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:48,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 06:08:48,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:08:48,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-27 06:08:48,451 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:48,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:48,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1745986743, now seen corresponding path program 2 times [2018-10-27 06:08:48,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:48,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:48,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:48,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:48,886 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-27 06:08:49,080 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 06:08:49,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:08:49,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:08:49,080 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-10-27 06:08:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:49,156 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-10-27 06:08:49,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:08:49,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 75 transitions. [2018-10-27 06:08:49,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-10-27 06:08:49,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 71 states and 74 transitions. [2018-10-27 06:08:49,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-10-27 06:08:49,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-10-27 06:08:49,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 74 transitions. [2018-10-27 06:08:49,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:49,161 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-10-27 06:08:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 74 transitions. [2018-10-27 06:08:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2018-10-27 06:08:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-27 06:08:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-10-27 06:08:49,163 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-10-27 06:08:49,164 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-10-27 06:08:49,164 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:08:49,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 56 transitions. [2018-10-27 06:08:49,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-10-27 06:08:49,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:49,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:49,165 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:49,165 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:49,166 INFO L793 eck$LassoCheckResult]: Stem: 1216#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 1184#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1176#L11-4 assume true; 1177#L11-1 assume !!(avg_~i~0 < ~N~0); 1219#L12 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12 1218#L12-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1181#L11-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1178#L11-4 assume true; 1179#L11-1 assume !!(avg_~i~0 < ~N~0); 1199#L12 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12 1193#L12-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1194#L11-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1217#L11-4 assume true; 1214#L11-1 assume !(avg_~i~0 < ~N~0); 1173#L11-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 1174#L14 main_#t~ret3 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3; 1180#L29 SUMMARY for call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 1175#L29-1 main_~temp~0 := main_#t~mem4;havoc main_#t~mem4; 1172#L29-2 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 1170#L29-3 SUMMARY for call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 1171#L29-4 havoc main_#t~mem5; 1203#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 1200#L29-6 assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1195#L11-10 assume true; 1196#L11-7 assume !!(avg_~i~0 < ~N~0); 1222#L12-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12-2 1221#L12-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1201#L11-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1197#L11-10 assume true; 1198#L11-7 assume !!(avg_~i~0 < ~N~0); 1189#L12-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12-2 1190#L12-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1212#L11-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1220#L11-10 assume true; 1204#L11-7 assume !(avg_~i~0 < ~N~0); 1191#L11-11 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 1192#L14-1 main_#t~ret6 := avg_#res;assume { :end_inline_avg } true;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6; 1202#L31 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L31 1182#L31-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 1183#L32-4 [2018-10-27 06:08:49,166 INFO L795 eck$LassoCheckResult]: Loop: 1183#L32-4 assume true; 1186#L32-1 assume !!(main_~i~1 < ~N~0 - 1); 1188#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L33 1215#L33-1 SUMMARY for call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L33-1 1213#L33-2 havoc main_#t~mem9; 1210#L32-3 main_#t~post8 := main_~i~1;main_~i~1 := main_#t~post8 + 1;havoc main_#t~post8; 1183#L32-4 [2018-10-27 06:08:49,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash 707165691, now seen corresponding path program 2 times [2018-10-27 06:08:49,169 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:49,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:49,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:49,177 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:08:49,177 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:08:49,177 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:08:49,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:08:49,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:08:49,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-10-27 06:08:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:49,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:49,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1745986743, now seen corresponding path program 3 times [2018-10-27 06:08:49,294 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:49,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:49,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:49,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:49,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:49,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:49,310 INFO L82 PathProgramCache]: Analyzing trace with hash 559478211, now seen corresponding path program 1 times [2018-10-27 06:08:49,310 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:49,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:49,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:49,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:49,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:49,318 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:08:49,318 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:08:49,319 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:08:49,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:49,904 WARN L179 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-27 06:08:50,086 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 06:08:51,648 WARN L179 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 215 DAG size of output: 186 [2018-10-27 06:09:08,425 WARN L179 SmtUtils]: Spent 15.49 s on a formula simplification. DAG size of input: 436 DAG size of output: 132 [2018-10-27 06:09:08,430 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:08,431 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:08,431 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:08,431 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:08,431 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:08,431 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:08,431 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:08,431 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:08,431 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-10-27 06:09:08,431 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:08,431 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:08,434 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:09:08,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:08,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:08,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:08,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:08,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:08,903 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 110 [2018-10-27 06:09:20,253 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 7472 conjuctions. This might take some time... [2018-10-27 06:09:20,304 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 6 conjuctions. [2018-10-27 06:09:25,142 WARN L179 SmtUtils]: Spent 4.83 s on a formula simplification. DAG size of input: 138 DAG size of output: 119 [2018-10-27 06:09:25,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:25,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:25,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:25,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:25,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:25,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:25,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:25,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:25,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:25,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:25,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:25,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:25,247 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:09:32,288 WARN L179 SmtUtils]: Spent 6.80 s on a formula simplification. DAG size of input: 306 DAG size of output: 173 [2018-10-27 06:09:32,404 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-10-27 06:09:52,089 WARN L179 SmtUtils]: Spent 19.63 s on a formula simplification. DAG size of input: 204 DAG size of output: 156 [2018-10-27 06:09:52,147 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:52,147 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:52,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:52,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:52,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:52,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:52,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:52,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:52,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:52,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:52,155 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:52,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:52,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:52,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:52,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:52,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:52,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:52,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:52,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:52,157 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:52,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:52,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:52,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:52,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:52,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:52,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:52,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:52,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:52,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:52,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:52,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:52,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:52,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:52,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:52,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:52,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:52,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:52,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:52,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:52,173 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:52,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:52,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:52,179 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:52,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:52,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:52,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:52,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:52,194 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-10-27 06:09:52,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:52,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:52,216 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-10-27 06:09:52,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:52,309 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:52,397 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:09:52,397 INFO L444 ModelExtractionUtils]: 57 out of 64 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:09:52,397 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:52,399 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:52,400 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:52,400 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~#x~0.offset, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -4*ULTIMATE.start_main_~i~1 - 1*ULTIMATE.start_main_~#x~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2018-10-27 06:09:52,494 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:09:52,496 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:09:52,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:52,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:52,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:52,550 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:09:52,550 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-10-27 06:09:52,578 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 66 states and 71 transitions. Complement of second has 6 states. [2018-10-27 06:09:52,580 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 [2018-10-27 06:09:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:09:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-10-27 06:09:52,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 40 letters. Loop has 6 letters. [2018-10-27 06:09:52,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:52,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 46 letters. Loop has 6 letters. [2018-10-27 06:09:52,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:52,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 40 letters. Loop has 12 letters. [2018-10-27 06:09:52,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:52,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 71 transitions. [2018-10-27 06:09:52,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:09:52,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 55 states and 59 transitions. [2018-10-27 06:09:52,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-10-27 06:09:52,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-10-27 06:09:52,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2018-10-27 06:09:52,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:52,584 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-10-27 06:09:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2018-10-27 06:09:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-27 06:09:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 06:09:52,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-10-27 06:09:52,587 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-10-27 06:09:52,587 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-10-27 06:09:52,587 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:09:52,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 59 transitions. [2018-10-27 06:09:52,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:09:52,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:52,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:52,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:52,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:52,589 INFO L793 eck$LassoCheckResult]: Stem: 1539#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1509#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 1508#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1500#L11-4 assume true; 1501#L11-1 assume !!(avg_~i~0 < ~N~0); 1523#L12 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12 1518#L12-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1505#L11-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1502#L11-4 assume true; 1503#L11-1 assume !!(avg_~i~0 < ~N~0); 1544#L12 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12 1543#L12-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1542#L11-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1541#L11-4 assume true; 1538#L11-1 assume !(avg_~i~0 < ~N~0); 1497#L11-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 1498#L14 main_#t~ret3 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3; 1504#L29 SUMMARY for call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 1499#L29-1 main_~temp~0 := main_#t~mem4;havoc main_#t~mem4; 1496#L29-2 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 1494#L29-3 SUMMARY for call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 1495#L29-4 havoc main_#t~mem5; 1527#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 1524#L29-6 assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1519#L11-10 assume true; 1520#L11-7 assume !!(avg_~i~0 < ~N~0); 1514#L12-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12-2 1515#L12-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1525#L11-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1521#L11-10 assume true; 1522#L11-7 assume !!(avg_~i~0 < ~N~0); 1548#L12-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12-2 1547#L12-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1546#L11-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1545#L11-10 assume true; 1528#L11-7 assume !(avg_~i~0 < ~N~0); 1516#L11-11 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 1517#L14-1 main_#t~ret6 := avg_#res;assume { :end_inline_avg } true;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6; 1526#L31 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L31 1506#L31-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 1507#L32-4 assume true; 1510#L32-1 assume !(main_~i~1 < ~N~0 - 1); 1511#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + (~N~0 - 1) * 4, 4); srcloc: L32-5 1529#L35 assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1530#L11-16 [2018-10-27 06:09:52,589 INFO L795 eck$LassoCheckResult]: Loop: 1530#L11-16 assume true; 1531#L11-13 assume !!(avg_~i~0 < ~N~0); 1536#L12-4 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12-4 1534#L12-5 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1533#L11-15 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1530#L11-16 [2018-10-27 06:09:52,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:52,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1769249921, now seen corresponding path program 1 times [2018-10-27 06:09:52,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:52,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:52,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:52,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:52,595 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:09:52,595 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:09:52,595 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-10-27 06:09:52,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:09:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:52,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 06:09:52,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:52,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:09:52,702 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:52,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:52,703 INFO L82 PathProgramCache]: Analyzing trace with hash 100356973, now seen corresponding path program 1 times [2018-10-27 06:09:52,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:52,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:52,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:52,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:52,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:52,938 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 06:09:53,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:09:53,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:09:53,039 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-10-27 06:09:53,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:53,094 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-10-27 06:09:53,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:09:53,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 64 transitions. [2018-10-27 06:09:53,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:09:53,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 60 states and 63 transitions. [2018-10-27 06:09:53,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-10-27 06:09:53,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-10-27 06:09:53,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 63 transitions. [2018-10-27 06:09:53,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:53,096 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-10-27 06:09:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 63 transitions. [2018-10-27 06:09:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-10-27 06:09:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 06:09:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-10-27 06:09:53,101 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-10-27 06:09:53,101 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-10-27 06:09:53,101 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:09:53,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 58 transitions. [2018-10-27 06:09:53,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:09:53,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:53,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:53,103 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:53,103 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:53,103 INFO L793 eck$LassoCheckResult]: Stem: 1792#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1761#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 1760#L20 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1752#L11-4 assume true; 1753#L11-1 assume !!(avg_~i~0 < ~N~0); 1796#L12 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12 1795#L12-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1757#L11-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1754#L11-4 assume true; 1755#L11-1 assume !!(avg_~i~0 < ~N~0); 1776#L12 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12 1770#L12-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1771#L11-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1794#L11-4 assume true; 1791#L11-1 assume !(avg_~i~0 < ~N~0); 1749#L11-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 1750#L14 main_#t~ret3 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3; 1756#L29 SUMMARY for call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 1751#L29-1 main_~temp~0 := main_#t~mem4;havoc main_#t~mem4; 1748#L29-2 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 1746#L29-3 SUMMARY for call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 1747#L29-4 havoc main_#t~mem5; 1780#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 1777#L29-6 assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1772#L11-10 assume true; 1773#L11-7 assume !!(avg_~i~0 < ~N~0); 1766#L12-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12-2 1767#L12-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1778#L11-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1774#L11-10 assume true; 1775#L11-7 assume !!(avg_~i~0 < ~N~0); 1800#L12-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12-2 1799#L12-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1798#L11-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1797#L11-10 assume true; 1781#L11-7 assume !(avg_~i~0 < ~N~0); 1768#L11-11 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % ~N~0 != 0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else avg_~ret~0 / ~N~0 + 1) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 1769#L14-1 main_#t~ret6 := avg_#res;assume { :end_inline_avg } true;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6; 1779#L31 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L31 1758#L31-1 main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 1759#L32-4 assume true; 1764#L32-1 assume !!(main_~i~1 < ~N~0 - 1); 1765#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L33 1793#L33-1 SUMMARY for call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L33-1 1790#L33-2 havoc main_#t~mem9; 1788#L32-3 main_#t~post8 := main_~i~1;main_~i~1 := main_#t~post8 + 1;havoc main_#t~post8; 1785#L32-4 assume true; 1762#L32-1 assume !(main_~i~1 < ~N~0 - 1); 1763#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + (~N~0 - 1) * 4, 4); srcloc: L32-5 1782#L35 assume { :begin_inline_avg } true;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1783#L11-16 [2018-10-27 06:09:53,104 INFO L795 eck$LassoCheckResult]: Loop: 1783#L11-16 assume true; 1784#L11-13 assume !!(avg_~i~0 < ~N~0); 1789#L12-4 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L12-4 1787#L12-5 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1786#L11-15 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1783#L11-16 [2018-10-27 06:09:53,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:53,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1017952071, now seen corresponding path program 1 times [2018-10-27 06:09:53,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:53,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:53,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:53,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,117 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:09:53,117 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:09:53,117 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:09:53,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash 100356973, now seen corresponding path program 2 times [2018-10-27 06:09:53,223 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:53,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:53,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:53,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:53,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1826867225, now seen corresponding path program 1 times [2018-10-27 06:09:53,229 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:53,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:53,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:53,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,241 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 06:09:53,241 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 06:09:53,241 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0775dc43-a1cb-46c1-8972-0834716c09ce/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 06:09:53,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,556 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 06:09:53,727 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:09:55,610 WARN L179 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 259 DAG size of output: 222 [2018-10-27 06:10:07,158 WARN L179 SmtUtils]: Spent 11.17 s on a formula simplification. DAG size of input: 242 DAG size of output: 130 [2018-10-27 06:10:07,161 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:07,161 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:07,161 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:07,161 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:07,161 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:07,161 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:07,162 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:07,162 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:07,162 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-10-27 06:10:07,162 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:07,162 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:07,164 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:10:07,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,396 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 110 [2018-10-27 06:10:13,275 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6213 conjuctions. This might take some time... [2018-10-27 06:10:13,326 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 6 conjuctions. [2018-10-27 06:10:15,141 WARN L179 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 125 DAG size of output: 109 [2018-10-27 06:10:15,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:15,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:15,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:15,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:15,207 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:10:15,217 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 5297 disjunctions. This might take some time... [2018-10-27 06:10:15,331 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 137 disjunctions. [2018-10-27 06:10:15,949 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 06:10:33,700 WARN L179 SmtUtils]: Spent 17.70 s on a formula simplification. DAG size of input: 242 DAG size of output: 123 [2018-10-27 06:10:33,720 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-10-27 06:10:44,284 WARN L179 SmtUtils]: Spent 10.41 s on a formula simplification. DAG size of input: 251 DAG size of output: 108 [2018-10-27 06:10:44,306 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:44,306 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:44,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:44,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:44,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:44,307 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:44,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:44,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:44,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:44,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:44,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:44,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:44,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:44,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:44,324 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:44,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:44,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:44,325 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:44,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:44,327 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:44,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:44,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:44,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:44,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:44,339 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:44,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:44,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:44,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:44,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:44,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:44,342 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:44,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:44,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:44,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:44,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:44,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:44,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:44,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:44,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:44,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:44,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:44,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:44,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:44,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:44,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,371 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:44,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,372 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:44,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:44,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:44,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:44,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:44,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:44,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:44,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:44,391 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-10-27 06:10:44,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:44,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:44,397 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-10-27 06:10:44,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:44,479 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:44,551 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-10-27 06:10:44,552 INFO L444 ModelExtractionUtils]: 37 out of 46 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-10-27 06:10:44,552 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:44,552 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:44,553 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:44,553 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~x.offset, v_rep(select #length ULTIMATE.start_avg_~x.base)_3, ULTIMATE.start_avg_~i~0) = -1*ULTIMATE.start_avg_~x.offset + 1*v_rep(select #length ULTIMATE.start_avg_~x.base)_3 - 4*ULTIMATE.start_avg_~i~0 Supporting invariants [] [2018-10-27 06:10:44,766 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2018-10-27 06:10:44,775 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:10:45,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:45,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:45,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:45,134 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:10:45,134 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 58 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-10-27 06:10:45,173 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 58 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 60 states and 64 transitions. Complement of second has 6 states. [2018-10-27 06:10:45,174 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 [2018-10-27 06:10:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:10:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-10-27 06:10:45,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 50 letters. Loop has 5 letters. [2018-10-27 06:10:45,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:45,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 55 letters. Loop has 5 letters. [2018-10-27 06:10:45,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:45,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 50 letters. Loop has 10 letters. [2018-10-27 06:10:45,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:45,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 64 transitions. [2018-10-27 06:10:45,177 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:45,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 0 states and 0 transitions. [2018-10-27 06:10:45,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:10:45,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:10:45,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:10:45,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:45,177 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:45,177 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:45,177 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:45,177 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:10:45,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:10:45,177 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:45,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:10:45,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:10:45 BoogieIcfgContainer [2018-10-27 06:10:45,183 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:10:45,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:10:45,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:10:45,183 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:10:45,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:36" (3/4) ... [2018-10-27 06:10:45,191 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:10:45,191 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:10:45,192 INFO L168 Benchmark]: Toolchain (without parser) took 130053.27 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 960.2 MB in the beginning and 1.7 GB in the end (delta: -741.3 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-10-27 06:10:45,193 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:45,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.18 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:45,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.06 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:45,194 INFO L168 Benchmark]: Boogie Preprocessor took 30.80 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:45,194 INFO L168 Benchmark]: RCFGBuilder took 677.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:45,195 INFO L168 Benchmark]: BuchiAutomizer took 129045.18 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -593.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-10-27 06:10:45,195 INFO L168 Benchmark]: Witness Printer took 8.19 ms. Allocated memory is still 4.0 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:45,197 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 241.18 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.06 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.80 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 677.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 129045.18 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -593.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 8.19 ms. Allocated memory is still 4.0 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (5 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -4 * i + -1 * x + unknown-#length-unknown[x] and consists of 4 locations. One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 128.9s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 127.2s. Construction of modules took 0.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 55 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 275 SDtfs, 276 SDslu, 195 SDs, 0 SdLazy, 247 SolverSat, 23 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1169 mio100 ax100 hnf99 lsp429 ukn37 mio100 lsp276 div63 bol100 ite100 ukn100 eq170 hnf93 smp43 dnf2340 smp32 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 123ms VariablesStem: 18 VariablesLoop: 6 DisjunctsStem: 6 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...