./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_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_ec2bec44-1291-4bd5-aacc-cb6ce458525a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ec2bec44-1291-4bd5-aacc-cb6ce458525a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ec2bec44-1291-4bd5-aacc-cb6ce458525a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ec2bec44-1291-4bd5-aacc-cb6ce458525a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ec2bec44-1291-4bd5-aacc-cb6ce458525a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ec2bec44-1291-4bd5-aacc-cb6ce458525a/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 65401fe061f89bb729dffabf74050dfab9fe7d77 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:01:36,802 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:01:36,804 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:01:36,812 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:01:36,813 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:01:36,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:01:36,814 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:01:36,815 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:01:36,816 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:01:36,817 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:01:36,818 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:01:36,818 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:01:36,818 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:01:36,819 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:01:36,820 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:01:36,820 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:01:36,821 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:01:36,822 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:01:36,824 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:01:36,825 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:01:36,825 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:01:36,826 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:01:36,828 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:01:36,828 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:01:36,829 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:01:36,829 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:01:36,830 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:01:36,831 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:01:36,831 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:01:36,832 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:01:36,832 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:01:36,833 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:01:36,833 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:01:36,833 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:01:36,834 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:01:36,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:01:36,835 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ec2bec44-1291-4bd5-aacc-cb6ce458525a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 04:01:36,846 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:01:36,846 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:01:36,847 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:01:36,847 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:01:36,847 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:01:36,847 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:01:36,848 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:01:36,848 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:01:36,848 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:01:36,848 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:01:36,848 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:01:36,848 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:01:36,848 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:01:36,849 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:01:36,849 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:01:36,849 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:01:36,849 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:01:36,849 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:01:36,849 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:01:36,849 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:01:36,850 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:01:36,851 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:01:36,851 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:01:36,851 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:01:36,851 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:01:36,851 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:01:36,851 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:01:36,851 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:01:36,851 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:01:36,852 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:01:36,852 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:01:36,852 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_ec2bec44-1291-4bd5-aacc-cb6ce458525a/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 -> 65401fe061f89bb729dffabf74050dfab9fe7d77 [2018-11-10 04:01:36,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:01:36,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:01:36,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:01:36,888 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:01:36,888 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:01:36,888 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ec2bec44-1291-4bd5-aacc-cb6ce458525a/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-11-10 04:01:36,933 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec2bec44-1291-4bd5-aacc-cb6ce458525a/bin-2019/uautomizer/data/319bc2223/d1c1d1240a7a4e9a86dd79ef8d8210dc/FLAGa7f1effc1 [2018-11-10 04:01:37,366 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:01:37,367 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ec2bec44-1291-4bd5-aacc-cb6ce458525a/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-11-10 04:01:37,375 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec2bec44-1291-4bd5-aacc-cb6ce458525a/bin-2019/uautomizer/data/319bc2223/d1c1d1240a7a4e9a86dd79ef8d8210dc/FLAGa7f1effc1 [2018-11-10 04:01:37,382 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ec2bec44-1291-4bd5-aacc-cb6ce458525a/bin-2019/uautomizer/data/319bc2223/d1c1d1240a7a4e9a86dd79ef8d8210dc [2018-11-10 04:01:37,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:01:37,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:01:37,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:01:37,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:01:37,389 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:01:37,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:01:37" (1/1) ... [2018-11-10 04:01:37,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710b2ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:37, skipping insertion in model container [2018-11-10 04:01:37,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:01:37" (1/1) ... [2018-11-10 04:01:37,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:01:37,427 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:01:37,602 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:01:37,609 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:01:37,637 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:01:37,659 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:01:37,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:37 WrapperNode [2018-11-10 04:01:37,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:01:37,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:01:37,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:01:37,660 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:01:37,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:37" (1/1) ... [2018-11-10 04:01:37,722 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:37" (1/1) ... [2018-11-10 04:01:37,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:01:37,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:01:37,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:01:37,734 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:01:37,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:37" (1/1) ... [2018-11-10 04:01:37,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:37" (1/1) ... [2018-11-10 04:01:37,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:37" (1/1) ... [2018-11-10 04:01:37,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:37" (1/1) ... [2018-11-10 04:01:37,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:37" (1/1) ... [2018-11-10 04:01:37,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:37" (1/1) ... [2018-11-10 04:01:37,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:37" (1/1) ... [2018-11-10 04:01:37,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:01:37,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:01:37,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:01:37,755 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:01:37,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2bec44-1291-4bd5-aacc-cb6ce458525a/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-11-10 04:01:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:01:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:01:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:01:37,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:01:37,952 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:01:37,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:01:37 BoogieIcfgContainer [2018-11-10 04:01:37,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:01:37,953 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:01:37,953 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:01:37,956 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:01:37,956 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:01:37,957 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:01:37" (1/3) ... [2018-11-10 04:01:37,957 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51db35b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:01:37, skipping insertion in model container [2018-11-10 04:01:37,957 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:01:37,957 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:37" (2/3) ... [2018-11-10 04:01:37,958 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51db35b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:01:37, skipping insertion in model container [2018-11-10 04:01:37,958 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:01:37,958 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:01:37" (3/3) ... [2018-11-10 04:01:37,959 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-11-10 04:01:38,002 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:01:38,003 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:01:38,003 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:01:38,003 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:01:38,003 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:01:38,003 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:01:38,004 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:01:38,004 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:01:38,004 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:01:38,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 04:01:38,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:01:38,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:01:38,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:01:38,032 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 04:01:38,032 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 04:01:38,032 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:01:38,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 04:01:38,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:01:38,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:01:38,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:01:38,034 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 04:01:38,034 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 04:01:38,039 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 18#L551true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 25#L551-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~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_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 23#L543-4true [2018-11-10 04:01:38,040 INFO L795 eck$LassoCheckResult]: Loop: 23#L543-4true assume true; 13#L543-1true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 20#L544-4true assume !true; 21#L543-3true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := sort_#t~post2 + 1;havoc sort_#t~post2; 23#L543-4true [2018-11-10 04:01:38,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:38,043 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-10 04:01:38,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:38,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:38,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:38,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:38,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1329512, now seen corresponding path program 1 times [2018-11-10 04:01:38,116 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:38,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:38,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:38,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:38,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:38,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:38,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:01:38,142 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:01:38,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 04:01:38,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 04:01:38,152 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-10 04:01:38,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:38,156 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-10 04:01:38,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 04:01:38,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-10 04:01:38,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:01:38,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 22 transitions. [2018-11-10 04:01:38,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 04:01:38,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 04:01:38,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-10 04:01:38,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:01:38,162 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 04:01:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-10 04:01:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 04:01:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 04:01:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-10 04:01:38,186 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 04:01:38,186 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 04:01:38,186 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:01:38,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-10 04:01:38,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:01:38,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:01:38,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:01:38,187 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 04:01:38,187 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:01:38,187 INFO L793 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 65#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 66#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 71#L551-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~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_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 72#L543-4 [2018-11-10 04:01:38,187 INFO L795 eck$LassoCheckResult]: Loop: 72#L543-4 assume true; 67#L543-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 68#L544-4 assume true; 61#L544-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 62#L543-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := sort_#t~post2 + 1;havoc sort_#t~post2; 72#L543-4 [2018-11-10 04:01:38,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:38,187 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-10 04:01:38,188 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:38,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:38,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:38,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:38,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:38,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:38,204 INFO L82 PathProgramCache]: Analyzing trace with hash 41193125, now seen corresponding path program 1 times [2018-11-10 04:01:38,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:38,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:38,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:38,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:01:38,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:38,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:38,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:01:38,223 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:01:38,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:01:38,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:01:38,223 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-10 04:01:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:38,249 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-10 04:01:38,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:01:38,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-10 04:01:38,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 04:01:38,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 24 transitions. [2018-11-10 04:01:38,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 04:01:38,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 04:01:38,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-11-10 04:01:38,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:01:38,252 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 04:01:38,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-11-10 04:01:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 04:01:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 04:01:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-10 04:01:38,253 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 04:01:38,253 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 04:01:38,253 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:01:38,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2018-11-10 04:01:38,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 04:01:38,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:01:38,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:01:38,254 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 04:01:38,254 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:38,255 INFO L793 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 110#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 111#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 117#L551-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~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_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 119#L543-4 [2018-11-10 04:01:38,255 INFO L795 eck$LassoCheckResult]: Loop: 119#L543-4 assume true; 113#L543-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 114#L544-4 assume true; 108#L544-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0); 102#L545 SUMMARY for call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + sort_~i~0 * 4, 4); srcloc: L545 103#L545-1 SUMMARY for call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + (sort_~i~0 + 1) * 4, 4); srcloc: L545-1 105#L545-2 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 109#L544-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := sort_#t~post3 + 1;havoc sort_#t~post3; 116#L544-4 assume true; 120#L544-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 118#L543-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := sort_#t~post2 + 1;havoc sort_#t~post2; 119#L543-4 [2018-11-10 04:01:38,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:38,255 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-11-10 04:01:38,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:38,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:38,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:38,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:38,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:38,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:38,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1946947997, now seen corresponding path program 1 times [2018-11-10 04:01:38,269 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:38,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:38,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:38,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:01:38,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:38,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:38,286 INFO L82 PathProgramCache]: Analyzing trace with hash -595862727, now seen corresponding path program 1 times [2018-11-10 04:01:38,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:38,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:38,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:38,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:38,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:38,536 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:01:38,537 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:01:38,537 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:01:38,537 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:01:38,537 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:01:38,537 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:01:38,538 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:01:38,538 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:01:38,538 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 04:01:38,538 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:01:38,538 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:01:38,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:38,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:38,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:38,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:38,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:38,689 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-11-10 04:01:38,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:38,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:38,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:38,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:38,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:38,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:38,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:39,007 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:01:39,010 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:01:39,011 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-11-10 04:01:39,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:39,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:39,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:39,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,016 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-11-10 04:01:39,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:39,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:39,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:39,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,018 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-11-10 04:01:39,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:39,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:39,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,024 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-11-10 04:01:39,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:39,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:39,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,030 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-11-10 04:01:39,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:39,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:39,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,038 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-11-10 04:01:39,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:39,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:39,043 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,043 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-11-10 04:01:39,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,044 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:01:39,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,047 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:01:39,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:39,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,061 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-11-10 04:01:39,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:39,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:39,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,073 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-11-10 04:01:39,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:39,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:39,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:39,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,076 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-11-10 04:01:39,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:39,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:39,082 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,082 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-11-10 04:01:39,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:39,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:39,149 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:01:39,175 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 04:01:39,175 INFO L444 ModelExtractionUtils]: 31 out of 43 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-10 04:01:39,177 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:01:39,178 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:01:39,178 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:01:39,179 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2018-11-10 04:01:39,192 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 04:01:39,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:39,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:39,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 04:01:39,279 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-11-10 04:01:39,280 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-10 04:01:39,317 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 38 states and 44 transitions. Complement of second has 6 states. [2018-11-10 04:01:39,320 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-11-10 04:01:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:01:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-10 04:01:39,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 11 letters. [2018-11-10 04:01:39,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:01:39,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 15 letters. Loop has 11 letters. [2018-11-10 04:01:39,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:01:39,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 22 letters. [2018-11-10 04:01:39,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:01:39,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 44 transitions. [2018-11-10 04:01:39,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:01:39,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 43 transitions. [2018-11-10 04:01:39,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 04:01:39,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 04:01:39,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2018-11-10 04:01:39,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:01:39,327 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-10 04:01:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2018-11-10 04:01:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-10 04:01:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 04:01:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-10 04:01:39,329 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-10 04:01:39,330 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-10 04:01:39,330 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:01:39,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2018-11-10 04:01:39,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:01:39,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:01:39,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:01:39,331 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:01:39,331 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:01:39,331 INFO L793 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 263#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 264#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 273#L551-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~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_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 276#L543-4 assume true; 265#L543-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 266#L544-4 [2018-11-10 04:01:39,331 INFO L795 eck$LassoCheckResult]: Loop: 266#L544-4 assume true; 257#L544-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0); 247#L545 SUMMARY for call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + sort_~i~0 * 4, 4); srcloc: L545 248#L545-1 SUMMARY for call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + (sort_~i~0 + 1) * 4, 4); srcloc: L545-1 253#L545-2 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 259#L544-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := sort_#t~post3 + 1;havoc sort_#t~post3; 266#L544-4 [2018-11-10 04:01:39,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:39,332 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-10 04:01:39,332 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:39,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:39,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:39,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:39,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:39,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143369, now seen corresponding path program 1 times [2018-11-10 04:01:39,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:39,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:39,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:39,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:39,352 INFO L82 PathProgramCache]: Analyzing trace with hash 577380690, now seen corresponding path program 1 times [2018-11-10 04:01:39,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:39,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:39,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:39,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:39,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:39,538 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:01:39,538 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:01:39,539 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:01:39,539 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:01:39,539 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:01:39,539 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:01:39,539 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:01:39,540 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:01:39,540 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-10 04:01:39,540 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:01:39,540 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:01:39,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:39,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:39,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:39,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:39,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:39,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:39,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:39,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:39,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:39,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:39,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:39,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:39,713 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-11-10 04:01:39,958 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:01:39,958 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:01:39,962 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-11-10 04:01:39,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:39,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:39,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:39,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,965 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-11-10 04:01:39,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:39,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:39,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:39,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,967 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-11-10 04:01:39,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:39,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:39,970 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,970 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-11-10 04:01:39,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:39,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:39,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:39,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,972 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-11-10 04:01:39,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:39,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:39,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:39,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,974 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-11-10 04:01:39,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:39,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:39,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:39,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,975 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-11-10 04:01:39,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:39,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:39,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,978 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-11-10 04:01:39,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:39,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:39,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:39,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,983 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-11-10 04:01:39,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:39,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:39,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:39,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,985 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-11-10 04:01:39,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:39,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:39,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:39,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,987 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-11-10 04:01:39,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:39,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:39,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:39,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,989 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-11-10 04:01:39,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:39,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:39,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:39,994 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-11-10 04:01:39,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:39,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:39,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:39,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:39,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:39,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:40,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:40,001 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-11-10 04:01:40,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:40,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:40,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:40,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:40,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:40,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:40,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:40,005 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-11-10 04:01:40,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:40,005 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:01:40,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:40,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:40,007 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:01:40,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:40,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:40,014 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-11-10 04:01:40,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:40,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:40,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:40,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:40,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:40,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:40,048 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:01:40,081 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-10 04:01:40,081 INFO L444 ModelExtractionUtils]: 33 out of 43 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 04:01:40,081 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:01:40,082 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:01:40,083 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:01:40,083 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2018-11-10 04:01:40,099 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 04:01:40,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:40,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:40,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:40,141 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-11-10 04:01:40,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 04:01:40,200 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 95 states and 109 transitions. Complement of second has 7 states. [2018-11-10 04:01:40,201 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-11-10 04:01:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:01:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 04:01:40,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-10 04:01:40,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:01:40,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 04:01:40,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:01:40,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 6 letters. Loop has 12 letters. [2018-11-10 04:01:40,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:01:40,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 109 transitions. [2018-11-10 04:01:40,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:01:40,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 55 states and 63 transitions. [2018-11-10 04:01:40,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 04:01:40,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 04:01:40,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2018-11-10 04:01:40,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:01:40,207 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-10 04:01:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2018-11-10 04:01:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-11-10 04:01:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 04:01:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-10 04:01:40,210 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-10 04:01:40,210 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-10 04:01:40,210 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:01:40,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 57 transitions. [2018-11-10 04:01:40,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:01:40,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:01:40,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:01:40,211 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:40,211 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:01:40,211 INFO L793 eck$LassoCheckResult]: Stem: 479#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 471#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 472#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 483#L551-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~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_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 487#L543-4 assume true; 488#L543-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 484#L544-4 assume true; 485#L544-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0); 457#L545 SUMMARY for call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + sort_~i~0 * 4, 4); srcloc: L545 458#L545-1 SUMMARY for call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + (sort_~i~0 + 1) * 4, 4); srcloc: L545-1 462#L545-2 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 470#L544-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := sort_#t~post3 + 1;havoc sort_#t~post3; 492#L544-4 assume true; 464#L544-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 465#L543-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := sort_#t~post2 + 1;havoc sort_#t~post2; 486#L543-4 assume true; 475#L543-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 476#L544-4 [2018-11-10 04:01:40,211 INFO L795 eck$LassoCheckResult]: Loop: 476#L544-4 assume true; 463#L544-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0); 455#L545 SUMMARY for call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + sort_~i~0 * 4, 4); srcloc: L545 456#L545-1 SUMMARY for call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + (sort_~i~0 + 1) * 4, 4); srcloc: L545-1 461#L545-2 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 468#L544-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := sort_#t~post3 + 1;havoc sort_#t~post3; 476#L544-4 [2018-11-10 04:01:40,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:40,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1393429858, now seen corresponding path program 2 times [2018-11-10 04:01:40,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:40,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:40,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:40,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:40,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:40,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:01:40,249 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2bec44-1291-4bd5-aacc-cb6ce458525a/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:01:40,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:01:40,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:01:40,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:01:40,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:40,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:01:40,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 04:01:40,307 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:01:40,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:40,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143369, now seen corresponding path program 2 times [2018-11-10 04:01:40,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:40,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:40,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:40,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:01:40,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:40,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:01:40,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:01:40,348 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-11-10 04:01:40,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:40,395 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-11-10 04:01:40,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:01:40,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 138 transitions. [2018-11-10 04:01:40,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:01:40,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 132 transitions. [2018-11-10 04:01:40,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-10 04:01:40,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-10 04:01:40,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 132 transitions. [2018-11-10 04:01:40,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:01:40,400 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 132 transitions. [2018-11-10 04:01:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 132 transitions. [2018-11-10 04:01:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 74. [2018-11-10 04:01:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 04:01:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-11-10 04:01:40,405 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-11-10 04:01:40,405 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-11-10 04:01:40,405 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:01:40,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 83 transitions. [2018-11-10 04:01:40,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:01:40,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:01:40,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:01:40,408 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:40,408 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:01:40,409 INFO L793 eck$LassoCheckResult]: Stem: 717#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 708#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 709#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 720#L551-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~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_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 725#L543-4 assume true; 712#L543-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 713#L544-4 assume true; 742#L544-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0); 743#L545 SUMMARY for call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + sort_~i~0 * 4, 4); srcloc: L545 756#L545-1 SUMMARY for call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + (sort_~i~0 + 1) * 4, 4); srcloc: L545-1 733#L545-2 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 732#L544-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := sort_#t~post3 + 1;havoc sort_#t~post3; 721#L544-4 assume true; 722#L544-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0); 752#L545 SUMMARY for call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + sort_~i~0 * 4, 4); srcloc: L545 698#L545-1 SUMMARY for call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + (sort_~i~0 + 1) * 4, 4); srcloc: L545-1 699#L545-2 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 705#L544-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := sort_#t~post3 + 1;havoc sort_#t~post3; 730#L544-4 assume true; 727#L544-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 723#L543-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := sort_#t~post2 + 1;havoc sort_#t~post2; 724#L543-4 assume true; 710#L543-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 711#L544-4 [2018-11-10 04:01:40,409 INFO L795 eck$LassoCheckResult]: Loop: 711#L544-4 assume true; 702#L544-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0); 690#L545 SUMMARY for call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + sort_~i~0 * 4, 4); srcloc: L545 691#L545-1 SUMMARY for call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + (sort_~i~0 + 1) * 4, 4); srcloc: L545-1 697#L545-2 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 704#L544-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := sort_#t~post3 + 1;havoc sort_#t~post3; 711#L544-4 [2018-11-10 04:01:40,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:40,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1931896682, now seen corresponding path program 3 times [2018-11-10 04:01:40,409 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:40,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:40,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:40,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:01:40,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:40,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:40,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143369, now seen corresponding path program 3 times [2018-11-10 04:01:40,427 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:40,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:40,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:40,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:01:40,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:40,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:40,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1623026530, now seen corresponding path program 4 times [2018-11-10 04:01:40,433 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:01:40,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:01:40,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:40,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:01:40,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:01:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:01:40,683 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 97 [2018-11-10 04:01:40,723 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:01:40,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:01:40,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:01:40,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:01:40,723 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:01:40,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:01:40,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:01:40,724 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:01:40,724 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-10 04:01:40,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:01:40,724 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:01:40,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:40,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:40,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:40,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:40,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:40,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:40,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:40,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:40,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:40,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:40,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:40,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:01:41,181 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:01:41,181 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:01:41,181 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-11-10 04:01:41,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:41,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:41,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:41,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:41,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:41,183 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-11-10 04:01:41,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:41,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:41,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:41,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:41,186 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-11-10 04:01:41,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:41,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:41,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:41,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:41,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:41,188 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-11-10 04:01:41,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:41,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:41,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:41,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:41,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:41,190 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-11-10 04:01:41,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:41,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:41,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:41,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:41,192 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-11-10 04:01:41,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:41,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:41,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:41,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:41,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:41,194 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-11-10 04:01:41,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:41,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:41,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:41,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:41,198 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:41,199 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-11-10 04:01:41,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:01:41,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:41,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:01:41,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:01:41,200 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:41,200 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-11-10 04:01:41,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:41,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:41,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:41,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:41,206 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-11-10 04:01:41,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:41,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:41,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:41,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:41,210 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-11-10 04:01:41,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:41,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:41,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:41,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:41,220 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-11-10 04:01:41,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:41,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:41,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:41,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:41,223 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-11-10 04:01:41,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,224 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:01:41,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,225 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:01:41,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:41,229 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:41,230 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-11-10 04:01:41,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:41,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:41,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:41,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:01:41,232 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-11-10 04:01:41,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:01:41,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:01:41,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:01:41,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:01:41,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:01:41,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:01:41,251 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:01:41,269 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 04:01:41,270 INFO L444 ModelExtractionUtils]: 37 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 04:01:41,270 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:01:41,270 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:01:41,271 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:01:41,271 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~x.offset, v_rep(select #length ULTIMATE.start_sort_~x.base)_3) = -4*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~x.offset + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_3 Supporting invariants [] [2018-11-10 04:01:41,289 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 04:01:41,290 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:01:41,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:41,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:41,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:41,325 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-11-10 04:01:41,325 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 04:01:41,349 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 105 states and 118 transitions. Complement of second has 7 states. [2018-11-10 04:01:41,350 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-11-10 04:01:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:01:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 04:01:41,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 04:01:41,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:01:41,351 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:01:41,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:41,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:41,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:41,390 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 04:01:41,390 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 04:01:41,407 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 105 states and 118 transitions. Complement of second has 7 states. [2018-11-10 04:01:41,409 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-11-10 04:01:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:01:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 04:01:41,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 04:01:41,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:01:41,410 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:01:41,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:41,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:41,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:41,447 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 04:01:41,447 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 04:01:41,467 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 136 states and 154 transitions. Complement of second has 6 states. [2018-11-10 04:01:41,468 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-11-10 04:01:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:01:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2018-11-10 04:01:41,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 04:01:41,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:01:41,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 29 letters. Loop has 6 letters. [2018-11-10 04:01:41,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:01:41,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 23 letters. Loop has 12 letters. [2018-11-10 04:01:41,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:01:41,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 154 transitions. [2018-11-10 04:01:41,471 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:01:41,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 0 states and 0 transitions. [2018-11-10 04:01:41,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:01:41,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:01:41,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:01:41,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:01:41,472 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:01:41,472 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:01:41,472 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:01:41,472 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 04:01:41,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:01:41,472 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:01:41,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:01:41,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:01:41 BoogieIcfgContainer [2018-11-10 04:01:41,478 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:01:41,478 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:01:41,478 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:01:41,478 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:01:41,479 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:01:37" (3/4) ... [2018-11-10 04:01:41,481 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:01:41,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:01:41,482 INFO L168 Benchmark]: Toolchain (without parser) took 4097.01 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 337.1 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -271.0 MB). Peak memory consumption was 66.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:01:41,482 INFO L168 Benchmark]: CDTParser took 0.14 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-11-10 04:01:41,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.36 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:01:41,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 936.1 MB in the beginning and 1.2 GB in the end (delta: -233.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:01:41,484 INFO L168 Benchmark]: Boogie Preprocessor took 20.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:01:41,484 INFO L168 Benchmark]: RCFGBuilder took 197.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:01:41,484 INFO L168 Benchmark]: BuchiAutomizer took 3524.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -80.9 MB). Peak memory consumption was 81.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:01:41,485 INFO L168 Benchmark]: Witness Printer took 3.25 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:01:41,487 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.14 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 274.36 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 936.1 MB in the beginning and 1.2 GB in the end (delta: -233.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 197.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3524.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -80.9 MB). Peak memory consumption was 81.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.25 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * pass + n and consists of 4 locations. One deterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. One nondeterministic module has affine ranking function -4 * i + -1 * x + unknown-#length-unknown[x] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 2.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 52 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 74 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 144 SDtfs, 196 SDslu, 89 SDs, 0 SdLazy, 152 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital147 mio100 ax100 hnf99 lsp95 ukn98 mio100 lsp55 div100 bol100 ite100 ukn100 eq183 hnf87 smp98 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...