./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3744ccec-222a-485b-a383-de7d3236e001/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3744ccec-222a-485b-a383-de7d3236e001/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3744ccec-222a-485b-a383-de7d3236e001/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3744ccec-222a-485b-a383-de7d3236e001/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3744ccec-222a-485b-a383-de7d3236e001/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3744ccec-222a-485b-a383-de7d3236e001/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 64bit --witnessprinter.graph.data.programhash a398041f87cd84898ae142142fdf4872d746c3b1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:16:45,831 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:16:45,832 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:16:45,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:16:45,840 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:16:45,840 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:16:45,841 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:16:45,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:16:45,843 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:16:45,843 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:16:45,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:16:45,844 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:16:45,845 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:16:45,845 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:16:45,846 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:16:45,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:16:45,847 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:16:45,848 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:16:45,850 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:16:45,851 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:16:45,851 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:16:45,852 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:16:45,854 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:16:45,854 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:16:45,854 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:16:45,855 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:16:45,856 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:16:45,856 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:16:45,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:16:45,857 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:16:45,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:16:45,858 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:16:45,858 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:16:45,858 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:16:45,859 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:16:45,859 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:16:45,859 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3744ccec-222a-485b-a383-de7d3236e001/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 13:16:45,870 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:16:45,870 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:16:45,871 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:16:45,871 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:16:45,871 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:16:45,871 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 13:16:45,871 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 13:16:45,871 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 13:16:45,872 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 13:16:45,872 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 13:16:45,872 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 13:16:45,872 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:16:45,872 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:16:45,872 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:16:45,872 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:16:45,873 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 13:16:45,873 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 13:16:45,873 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 13:16:45,873 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:16:45,873 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 13:16:45,873 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 13:16:45,873 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:16:45,873 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:16:45,874 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 13:16:45,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:16:45,874 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:16:45,874 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 13:16:45,875 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 13:16:45,875 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_3744ccec-222a-485b-a383-de7d3236e001/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a398041f87cd84898ae142142fdf4872d746c3b1 [2018-11-10 13:16:45,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:16:45,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:16:45,909 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:16:45,910 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:16:45,910 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:16:45,911 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3744ccec-222a-485b-a383-de7d3236e001/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i [2018-11-10 13:16:45,954 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3744ccec-222a-485b-a383-de7d3236e001/bin-2019/uautomizer/data/e6464dbac/eec71203dc43486597154f81a729e8e8/FLAGe9be7f4be [2018-11-10 13:16:46,386 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:16:46,386 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3744ccec-222a-485b-a383-de7d3236e001/sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i [2018-11-10 13:16:46,393 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3744ccec-222a-485b-a383-de7d3236e001/bin-2019/uautomizer/data/e6464dbac/eec71203dc43486597154f81a729e8e8/FLAGe9be7f4be [2018-11-10 13:16:46,402 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3744ccec-222a-485b-a383-de7d3236e001/bin-2019/uautomizer/data/e6464dbac/eec71203dc43486597154f81a729e8e8 [2018-11-10 13:16:46,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:16:46,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:16:46,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:16:46,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:16:46,409 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:16:46,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:16:46" (1/1) ... [2018-11-10 13:16:46,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6604a2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:46, skipping insertion in model container [2018-11-10 13:16:46,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:16:46" (1/1) ... [2018-11-10 13:16:46,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:16:46,451 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:16:46,635 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:16:46,643 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:16:46,666 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:16:46,697 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:16:46,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:46 WrapperNode [2018-11-10 13:16:46,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:16:46,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:16:46,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:16:46,699 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:16:46,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:46" (1/1) ... [2018-11-10 13:16:46,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:46" (1/1) ... [2018-11-10 13:16:46,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:16:46,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:16:46,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:16:46,771 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:16:46,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:46" (1/1) ... [2018-11-10 13:16:46,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:46" (1/1) ... [2018-11-10 13:16:46,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:46" (1/1) ... [2018-11-10 13:16:46,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:46" (1/1) ... [2018-11-10 13:16:46,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:46" (1/1) ... [2018-11-10 13:16:46,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:46" (1/1) ... [2018-11-10 13:16:46,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:46" (1/1) ... [2018-11-10 13:16:46,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:16:46,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:16:46,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:16:46,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:16:46,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3744ccec-222a-485b-a383-de7d3236e001/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 13:16:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 13:16:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 13:16:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:16:46,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:16:47,023 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:16:47,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:16:47 BoogieIcfgContainer [2018-11-10 13:16:47,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:16:47,024 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 13:16:47,025 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 13:16:47,027 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 13:16:47,027 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:16:47,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:16:46" (1/3) ... [2018-11-10 13:16:47,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5611d13d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:16:47, skipping insertion in model container [2018-11-10 13:16:47,028 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:16:47,028 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:46" (2/3) ... [2018-11-10 13:16:47,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5611d13d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:16:47, skipping insertion in model container [2018-11-10 13:16:47,028 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:16:47,029 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:16:47" (3/3) ... [2018-11-10 13:16:47,030 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.17-alloca_true-termination_true-no-overflow.c.i [2018-11-10 13:16:47,065 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:16:47,065 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 13:16:47,065 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 13:16:47,065 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 13:16:47,066 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:16:47,066 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:16:47,066 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 13:16:47,066 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:16:47,066 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 13:16:47,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 13:16:47,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 13:16:47,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:16:47,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:16:47,095 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 13:16:47,095 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:47,095 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 13:16:47,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 13:16:47,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 13:16:47,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:16:47,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:16:47,097 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 13:16:47,097 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:47,103 INFO L793 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 24#L553true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 27#L553-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 23#L554true SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 8#L555true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 25#L557-4true [2018-11-10 13:16:47,104 INFO L795 eck$LassoCheckResult]: Loop: 25#L557-4true assume true; 4#L557true SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6#L557-1true SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 9#L557-2true assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 11#L558-5true assume !true; 13#L558-6true SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-6 16#L561true SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 18#L561-1true havoc test_fun_#t~mem11; 25#L557-4true [2018-11-10 13:16:47,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:47,109 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 1 times [2018-11-10 13:16:47,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:47,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:47,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:47,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:47,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:47,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:47,223 INFO L82 PathProgramCache]: Analyzing trace with hash 890771083, now seen corresponding path program 1 times [2018-11-10 13:16:47,223 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:47,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:47,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:47,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:47,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:47,247 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 13:16:47,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:16:47,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:16:47,250 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:16:47,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:16:47,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:16:47,260 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-10 13:16:47,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:16:47,265 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-10 13:16:47,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:16:47,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2018-11-10 13:16:47,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 13:16:47,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 21 transitions. [2018-11-10 13:16:47,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 13:16:47,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 13:16:47,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2018-11-10 13:16:47,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:16:47,271 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-10 13:16:47,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2018-11-10 13:16:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-10 13:16:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 13:16:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-10 13:16:47,289 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-10 13:16:47,289 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-10 13:16:47,289 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 13:16:47,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2018-11-10 13:16:47,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 13:16:47,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:16:47,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:16:47,290 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 13:16:47,290 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:47,291 INFO L793 eck$LassoCheckResult]: Stem: 77#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 75#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 76#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 73#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 69#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 70#L557-4 [2018-11-10 13:16:47,291 INFO L795 eck$LassoCheckResult]: Loop: 70#L557-4 assume true; 62#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 63#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 67#L557-2 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 66#L558-5 assume true; 64#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 65#L558-2 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 68#L558-3 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 71#L558-6 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-6 78#L561 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 79#L561-1 havoc test_fun_#t~mem11; 70#L557-4 [2018-11-10 13:16:47,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:47,291 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 2 times [2018-11-10 13:16:47,291 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:47,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:47,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:47,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:47,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:47,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:47,331 INFO L82 PathProgramCache]: Analyzing trace with hash -678709959, now seen corresponding path program 1 times [2018-11-10 13:16:47,331 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:47,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:47,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:47,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:16:47,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:47,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:47,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1018031179, now seen corresponding path program 1 times [2018-11-10 13:16:47,348 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:47,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:47,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:47,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:47,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:47,870 WARN L179 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 121 [2018-11-10 13:16:48,054 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-10 13:16:48,065 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:16:48,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:16:48,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:16:48,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:16:48,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:16:48,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:16:48,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:16:48,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:16:48,067 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 13:16:48,067 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:16:48,068 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:16:48,091 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 13:16:48,097 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 13:16:48,100 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 13:16:48,102 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 13:16:48,103 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 13:16:48,105 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 13:16:48,108 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 13:16:48,110 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 13:16:48,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:48,115 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 13:16:48,117 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 13:16:48,593 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2018-11-10 13:16:48,695 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 13:16:48,698 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 13:16:48,699 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 13:16:48,700 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 13:16:48,702 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 13:16:48,706 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 13:16:49,182 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:16:49,185 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:16:49,187 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 13:16:49,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:49,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:49,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:49,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,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 13:16:49,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:49,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:49,197 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,197 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 13:16:49,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:49,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:49,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:49,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,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 13:16:49,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:49,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:49,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,203 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 13:16:49,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:49,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:49,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,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 13:16:49,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:49,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:49,215 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,216 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 13:16:49,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:49,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:49,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:49,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,218 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 13:16:49,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:49,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:49,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:49,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,221 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 13:16:49,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:49,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:49,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:49,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,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 13:16:49,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:49,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:49,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:49,225 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,225 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 13:16:49,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:49,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:49,229 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,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 13:16:49,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:49,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:49,277 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,278 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 13:16:49,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:49,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:49,282 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,283 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 13:16:49,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:49,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:49,293 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,294 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 13:16:49,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,294 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:16:49,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,296 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:16:49,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:49,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,301 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 13:16:49,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:49,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:49,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,304 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 13:16:49,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,305 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:16:49,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,306 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:16:49,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:49,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,311 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 13:16:49,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:49,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:49,319 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,320 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 13:16:49,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:49,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:49,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:49,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:16:49,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:49,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:49,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:49,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:49,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:49,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:49,341 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:16:49,355 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 13:16:49,356 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 13:16:49,358 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:16:49,359 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 13:16:49,359 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:16:49,359 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 Supporting invariants [] [2018-11-10 13:16:49,482 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-10 13:16:49,488 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:16:49,489 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:16:49,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:49,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:16:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:49,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:16:49,633 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:49,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-11-10 13:16:49,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-11-10 13:16:49,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:49,684 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:49,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:49,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:49,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-11-10 13:16:49,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:49,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:49,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:49,731 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-11-10 13:16:49,758 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 13:16:49,761 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 13:16:49,762 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 21 transitions. cyclomatic complexity: 2 Second operand 8 states. [2018-11-10 13:16:49,835 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 21 transitions. cyclomatic complexity: 2. Second operand 8 states. Result 47 states and 50 transitions. Complement of second has 13 states. [2018-11-10 13:16:49,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 13:16:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 13:16:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-11-10 13:16:49,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 6 letters. Loop has 11 letters. [2018-11-10 13:16:49,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:49,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 17 letters. Loop has 11 letters. [2018-11-10 13:16:49,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:49,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 6 letters. Loop has 22 letters. [2018-11-10 13:16:49,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:49,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 50 transitions. [2018-11-10 13:16:49,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 13:16:49,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 43 states and 46 transitions. [2018-11-10 13:16:49,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 13:16:49,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-10 13:16:49,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 46 transitions. [2018-11-10 13:16:49,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:16:49,841 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-10 13:16:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 46 transitions. [2018-11-10 13:16:49,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-11-10 13:16:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-10 13:16:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-11-10 13:16:49,843 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-11-10 13:16:49,843 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-11-10 13:16:49,843 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 13:16:49,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 43 transitions. [2018-11-10 13:16:49,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 13:16:49,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:16:49,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:16:49,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:49,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:49,844 INFO L793 eck$LassoCheckResult]: Stem: 390#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 385#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 386#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 389#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 384#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 382#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 383#L557-4 assume true; 370#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 371#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 376#L557-2 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 378#L558-5 assume true; 365#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 366#L558-2 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 374#L558-3 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 380#L559 [2018-11-10 13:16:49,844 INFO L795 eck$LassoCheckResult]: Loop: 380#L559 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 363#L559-1 SUMMARY for call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 364#L559-2 havoc test_fun_#t~mem10; 369#L558-5 assume true; 399#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 398#L558-2 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 397#L558-3 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 380#L559 [2018-11-10 13:16:49,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:49,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2124378541, now seen corresponding path program 1 times [2018-11-10 13:16:49,845 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:49,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:49,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:49,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:49,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:49,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:49,871 INFO L82 PathProgramCache]: Analyzing trace with hash 137941670, now seen corresponding path program 1 times [2018-11-10 13:16:49,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:49,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:49,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:49,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:49,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:49,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:49,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1742529556, now seen corresponding path program 1 times [2018-11-10 13:16:49,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:49,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:49,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:49,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:49,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:50,311 WARN L179 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 140 [2018-11-10 13:16:50,495 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-11-10 13:16:50,497 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:16:50,498 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:16:50,498 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:16:50,498 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:16:50,498 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:16:50,498 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:16:50,498 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:16:50,498 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:16:50,498 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-10 13:16:50,498 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:16:50,498 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:16:50,502 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 13:16:50,505 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 13:16:50,506 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 13:16:50,507 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 13:16:50,508 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 13:16:50,510 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 13:16:50,510 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 13:16:50,511 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 13:16:50,513 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 13:16:50,514 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 13:16:50,515 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 13:16:50,516 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 13:16:50,517 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 13:16:50,907 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 123 [2018-11-10 13:16:50,984 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 13:16:50,985 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 13:16:50,986 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 13:16:50,987 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 13:16:50,988 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 13:16:51,375 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:16:51,375 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:16:51,375 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 13:16:51,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:51,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:51,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:51,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,378 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 13:16:51,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:51,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:51,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:51,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,379 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 13:16:51,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:51,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:51,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:51,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,380 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 13:16:51,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:51,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:51,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,383 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 13:16:51,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:51,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:51,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,386 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 13:16:51,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:51,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:51,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:51,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:16:51,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:51,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:51,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:51,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:16:51,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:51,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:51,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:16:51,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:51,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:51,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,401 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 13:16:51,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:51,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:51,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:51,403 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,404 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 13:16:51,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:51,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:51,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:51,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,406 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 13:16:51,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:51,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:51,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:51,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,408 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 13:16:51,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:51,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:51,410 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,411 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 13:16:51,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:51,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:51,425 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:16:51,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,426 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:16:51,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,427 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:16:51,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:51,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,430 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 13:16:51,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,430 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:16:51,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,431 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:16:51,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:51,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,434 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 13:16:51,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:51,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:51,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,437 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 13:16:51,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,437 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:16:51,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,438 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:16:51,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:51,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:51,441 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 13:16:51,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:51,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:51,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:51,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:51,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:51,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:51,454 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:16:51,466 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 13:16:51,467 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 13:16:51,467 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:16:51,468 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 13:16:51,468 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:16:51,468 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-10 13:16:51,617 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-11-10 13:16:51,619 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:16:51,619 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:16:51,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:51,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:16:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:51,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:16:51,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:51,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 50 [2018-11-10 13:16:51,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-10 13:16:51,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:51,714 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:51,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2018-11-10 13:16:51,727 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 13:16:51,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:51,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:51,761 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-11-10 13:16:51,815 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 13:16:51,816 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-10 13:16:51,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 43 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-10 13:16:51,904 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 43 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 58 states and 63 transitions. Complement of second has 11 states. [2018-11-10 13:16:51,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 13:16:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 13:16:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-10 13:16:51,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 14 letters. Loop has 7 letters. [2018-11-10 13:16:51,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:51,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-10 13:16:51,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:51,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 14 letters. Loop has 14 letters. [2018-11-10 13:16:51,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:51,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 63 transitions. [2018-11-10 13:16:51,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 13:16:51,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 56 states and 61 transitions. [2018-11-10 13:16:51,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-10 13:16:51,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-10 13:16:51,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 61 transitions. [2018-11-10 13:16:51,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:16:51,909 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-10 13:16:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 61 transitions. [2018-11-10 13:16:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-10 13:16:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 13:16:51,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-11-10 13:16:51,912 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-11-10 13:16:51,912 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-11-10 13:16:51,912 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 13:16:51,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 59 transitions. [2018-11-10 13:16:51,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 13:16:51,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:16:51,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:16:51,913 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:51,913 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:51,913 INFO L793 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 726#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 727#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 731#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 725#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 723#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 724#L557-4 assume true; 711#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 712#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 717#L557-2 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 721#L558-5 assume true; 728#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 743#L558-2 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 742#L558-3 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 741#L559 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 701#L559-1 SUMMARY for call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 702#L559-2 havoc test_fun_#t~mem10; 709#L558-5 assume true; 705#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 706#L558-2 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 715#L558-3 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 719#L558-6 [2018-11-10 13:16:51,914 INFO L795 eck$LassoCheckResult]: Loop: 719#L558-6 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-6 733#L561 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 735#L561-1 havoc test_fun_#t~mem11; 737#L557-4 assume true; 754#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 753#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 752#L557-2 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 749#L558-5 assume true; 747#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 745#L558-2 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 744#L558-3 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 719#L558-6 [2018-11-10 13:16:51,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:51,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1742529554, now seen corresponding path program 1 times [2018-11-10 13:16:51,914 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:51,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:51,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:51,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:51,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:51,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:51,937 INFO L82 PathProgramCache]: Analyzing trace with hash 115391313, now seen corresponding path program 2 times [2018-11-10 13:16:51,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:51,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:51,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:51,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:51,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:51,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:51,944 INFO L82 PathProgramCache]: Analyzing trace with hash 395924128, now seen corresponding path program 1 times [2018-11-10 13:16:51,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:51,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:51,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:51,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:16:51,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:52,579 WARN L179 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 155 [2018-11-10 13:16:52,853 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-11-10 13:16:52,855 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:16:52,855 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:16:52,855 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:16:52,855 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:16:52,855 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:16:52,855 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:16:52,855 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:16:52,855 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:16:52,855 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-10 13:16:52,855 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:16:52,855 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:16:52,857 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 13:16:52,858 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 13:16:52,860 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 13:16:52,861 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 13:16:52,862 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 13:16:52,863 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 13:16:52,864 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 13:16:53,302 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 131 [2018-11-10 13:16:53,393 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 13:16:53,394 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 13:16:53,396 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 13:16:53,396 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 13:16:53,398 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 13:16:53,399 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 13:16:53,400 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 13:16:53,402 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 13:16:53,402 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 13:16:53,403 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 13:16:53,863 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:16:53,863 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:16:53,863 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 13:16:53,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:53,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:53,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:53,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:53,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:53,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:53,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:53,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:53,866 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 13:16:53,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:53,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:53,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:53,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:53,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:53,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:53,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:53,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:53,867 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 13:16:53,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:53,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:53,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:53,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:53,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:53,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:53,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:53,868 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:53,868 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 13:16:53,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:53,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:53,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:53,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:53,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:53,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:53,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:53,871 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 13:16:53,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:53,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:53,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:53,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:53,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:53,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:53,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:53,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:53,872 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 13:16:53,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:53,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:53,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:53,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:53,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:53,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:53,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:53,874 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:53,874 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 13:16:53,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:53,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:53,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:53,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:53,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:53,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:53,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:53,891 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 13:16:53,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:53,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:53,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:53,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:53,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:53,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:53,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:53,894 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 13:16:53,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:53,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:53,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:53,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:53,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:53,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:53,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:53,900 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 13:16:53,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:53,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:53,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:53,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:53,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:53,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:53,903 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:53,903 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 13:16:53,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:53,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:53,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:53,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:53,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:53,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:53,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:53,906 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 13:16:53,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:53,906 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:16:53,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:53,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:53,907 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:16:53,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:53,909 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:53,910 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 13:16:53,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:53,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:53,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:53,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:53,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:53,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:53,924 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:16:53,936 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 13:16:53,936 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 13:16:53,937 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:16:53,937 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 13:16:53,938 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:16:53,938 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-11-10 13:16:54,066 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-10 13:16:54,067 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:16:54,068 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:16:54,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:54,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:16:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:54,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:16:54,137 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:54,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 50 [2018-11-10 13:16:54,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-10 13:16:54,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:54,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:54,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2018-11-10 13:16:54,176 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 13:16:54,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:16:54,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:54,202 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-11-10 13:16:54,249 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 13:16:54,249 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 13:16:54,249 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 59 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 13:16:54,306 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 59 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 132 states and 142 transitions. Complement of second has 13 states. [2018-11-10 13:16:54,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 13:16:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 13:16:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2018-11-10 13:16:54,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 21 letters. Loop has 11 letters. [2018-11-10 13:16:54,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:54,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 32 letters. Loop has 11 letters. [2018-11-10 13:16:54,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:54,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 21 letters. Loop has 22 letters. [2018-11-10 13:16:54,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:54,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 142 transitions. [2018-11-10 13:16:54,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 13:16:54,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 102 states and 110 transitions. [2018-11-10 13:16:54,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-10 13:16:54,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2018-11-10 13:16:54,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 110 transitions. [2018-11-10 13:16:54,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:16:54,316 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-10 13:16:54,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 110 transitions. [2018-11-10 13:16:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2018-11-10 13:16:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 13:16:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2018-11-10 13:16:54,320 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 98 transitions. [2018-11-10 13:16:54,320 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 98 transitions. [2018-11-10 13:16:54,320 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 13:16:54,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 98 transitions. [2018-11-10 13:16:54,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 13:16:54,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:16:54,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:16:54,322 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:54,322 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:54,322 INFO L793 eck$LassoCheckResult]: Stem: 1204#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 1198#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 1203#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 1196#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 1194#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 1195#L557-4 assume true; 1174#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1175#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 1185#L557-2 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 1251#L558-5 assume true; 1243#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1242#L558-2 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 1241#L558-3 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 1240#L558-6 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-6 1209#L561 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 1210#L561-1 havoc test_fun_#t~mem11; 1200#L557-4 assume true; 1201#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1250#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 1249#L557-2 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 1248#L558-5 assume true; 1247#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1246#L558-2 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 1245#L558-3 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 1244#L559 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 1215#L559-1 SUMMARY for call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 1180#L559-2 havoc test_fun_#t~mem10; 1181#L558-5 assume true; 1176#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1177#L558-2 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 1186#L558-3 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 1216#L558-6 [2018-11-10 13:16:54,322 INFO L795 eck$LassoCheckResult]: Loop: 1216#L558-6 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-6 1207#L561 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 1208#L561-1 havoc test_fun_#t~mem11; 1211#L557-4 assume true; 1172#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1173#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 1184#L557-2 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 1188#L558-5 assume true; 1257#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1256#L558-2 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 1252#L558-3 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 1216#L558-6 [2018-11-10 13:16:54,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:54,322 INFO L82 PathProgramCache]: Analyzing trace with hash -132664990, now seen corresponding path program 2 times [2018-11-10 13:16:54,322 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:54,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:54,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:54,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:54,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:16:54,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:16:54,722 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3744ccec-222a-485b-a383-de7d3236e001/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 13:16:54,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 13:16:54,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 13:16:54,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:16:54,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:16:54,759 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:54,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 13:16:54,795 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:54,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:54,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 13:16:54,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:54,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:54,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:54,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-10 13:16:54,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-11-10 13:16:54,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:16:54,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:54,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:54,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:54,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:16 [2018-11-10 13:16:54,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-10 13:16:54,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 13:16:54,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:54,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-10 13:16:54,941 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:54,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:54,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:54,947 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2018-11-10 13:16:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:16:54,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:16:54,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2018-11-10 13:16:54,993 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 13:16:54,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:54,993 INFO L82 PathProgramCache]: Analyzing trace with hash 115391313, now seen corresponding path program 3 times [2018-11-10 13:16:54,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:54,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:54,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:54,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:16:54,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:55,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 13:16:55,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-10 13:16:55,067 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. cyclomatic complexity: 13 Second operand 19 states. [2018-11-10 13:16:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:16:55,350 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-10 13:16:55,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 13:16:55,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 72 transitions. [2018-11-10 13:16:55,352 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:16:55,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2018-11-10 13:16:55,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:16:55,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:16:55,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:16:55,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:16:55,352 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:16:55,352 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:16:55,352 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:16:55,352 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 13:16:55,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:16:55,353 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:16:55,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 13:16:55,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:16:55 BoogieIcfgContainer [2018-11-10 13:16:55,361 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 13:16:55,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:16:55,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:16:55,362 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:16:55,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:16:47" (3/4) ... [2018-11-10 13:16:55,364 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:16:55,364 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:16:55,365 INFO L168 Benchmark]: Toolchain (without parser) took 8960.09 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 150.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:16:55,365 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:16:55,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.25 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.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 13:16:55,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -204.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:16:55,368 INFO L168 Benchmark]: Boogie Preprocessor took 14.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:16:55,368 INFO L168 Benchmark]: RCFGBuilder took 238.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:16:55,369 INFO L168 Benchmark]: BuchiAutomizer took 8336.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 165.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:16:55,369 INFO L168 Benchmark]: Witness Printer took 2.88 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:16:55,371 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 292.25 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.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 72.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -204.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 238.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8336.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 165.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.88 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 7 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 7.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 90 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 90 SDtfs, 90 SDslu, 107 SDs, 0 SdLazy, 330 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital641 mio100 ax103 hnf100 lsp94 ukn56 mio100 lsp34 div100 bol100 ite100 ukn100 eq197 hnf87 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 2 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...