./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.03_assume-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_905e765c-8b6e-4372-9d50-ba827e3ecc78/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_905e765c-8b6e-4372-9d50-ba827e3ecc78/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_905e765c-8b6e-4372-9d50-ba827e3ecc78/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_905e765c-8b6e-4372-9d50-ba827e3ecc78/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.03_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_905e765c-8b6e-4372-9d50-ba827e3ecc78/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_905e765c-8b6e-4372-9d50-ba827e3ecc78/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 b76149a90863628db6af524c153a3f434b0c2e82 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 12:51:23,131 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:51:23,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:51:23,138 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:51:23,139 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:51:23,139 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:51:23,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:51:23,141 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:51:23,143 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:51:23,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:51:23,144 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:51:23,144 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:51:23,145 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:51:23,145 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:51:23,146 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:51:23,147 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:51:23,147 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:51:23,148 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:51:23,150 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:51:23,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:51:23,151 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:51:23,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:51:23,154 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:51:23,154 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:51:23,154 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:51:23,155 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:51:23,156 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:51:23,156 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:51:23,157 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:51:23,158 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:51:23,158 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:51:23,158 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:51:23,158 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:51:23,158 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:51:23,159 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:51:23,159 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:51:23,159 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_905e765c-8b6e-4372-9d50-ba827e3ecc78/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:51:23,167 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:51:23,167 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:51:23,168 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:51:23,168 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:51:23,168 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:51:23,168 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:51:23,168 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:51:23,169 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:51:23,169 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:51:23,169 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:51:23,169 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:51:23,169 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:51:23,169 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:51:23,169 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:51:23,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:51:23,170 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:51:23,170 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:51:23,170 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:51:23,170 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:51:23,170 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:51:23,170 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:51:23,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:51:23,171 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:51:23,171 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:51:23,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:51:23,171 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:51:23,171 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:51:23,172 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:51:23,172 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_905e765c-8b6e-4372-9d50-ba827e3ecc78/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 -> b76149a90863628db6af524c153a3f434b0c2e82 [2018-11-10 12:51:23,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:51:23,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:51:23,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:51:23,211 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:51:23,211 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:51:23,212 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_905e765c-8b6e-4372-9d50-ba827e3ecc78/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.03_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 12:51:23,261 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_905e765c-8b6e-4372-9d50-ba827e3ecc78/bin-2019/uautomizer/data/5697cd3d8/f53eac8897ee4079bd34b4338644b753/FLAG19f8455db [2018-11-10 12:51:23,647 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:51:23,648 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_905e765c-8b6e-4372-9d50-ba827e3ecc78/sv-benchmarks/c/termination-memory-alloca/b.03_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 12:51:23,658 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_905e765c-8b6e-4372-9d50-ba827e3ecc78/bin-2019/uautomizer/data/5697cd3d8/f53eac8897ee4079bd34b4338644b753/FLAG19f8455db [2018-11-10 12:51:23,671 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_905e765c-8b6e-4372-9d50-ba827e3ecc78/bin-2019/uautomizer/data/5697cd3d8/f53eac8897ee4079bd34b4338644b753 [2018-11-10 12:51:23,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:51:23,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:51:23,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:51:23,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:51:23,680 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:51:23,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:51:23" (1/1) ... [2018-11-10 12:51:23,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b5db350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:23, skipping insertion in model container [2018-11-10 12:51:23,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:51:23" (1/1) ... [2018-11-10 12:51:23,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:51:23,724 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:51:23,943 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:51:23,951 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:51:23,981 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:51:24,013 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:51:24,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:24 WrapperNode [2018-11-10 12:51:24,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:51:24,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:51:24,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:51:24,015 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:51:24,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:24" (1/1) ... [2018-11-10 12:51:24,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:24" (1/1) ... [2018-11-10 12:51:24,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:51:24,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:51:24,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:51:24,091 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:51:24,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:24" (1/1) ... [2018-11-10 12:51:24,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:24" (1/1) ... [2018-11-10 12:51:24,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:24" (1/1) ... [2018-11-10 12:51:24,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:24" (1/1) ... [2018-11-10 12:51:24,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:24" (1/1) ... [2018-11-10 12:51:24,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:24" (1/1) ... [2018-11-10 12:51:24,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:24" (1/1) ... [2018-11-10 12:51:24,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:51:24,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:51:24,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:51:24,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:51:24,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_905e765c-8b6e-4372-9d50-ba827e3ecc78/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 12:51:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:51:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:51:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:51:24,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:51:24,357 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:51:24,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:51:24 BoogieIcfgContainer [2018-11-10 12:51:24,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:51:24,358 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:51:24,358 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:51:24,361 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:51:24,361 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:51:24,361 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:51:23" (1/3) ... [2018-11-10 12:51:24,362 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7277530c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:51:24, skipping insertion in model container [2018-11-10 12:51:24,362 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:51:24,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:24" (2/3) ... [2018-11-10 12:51:24,362 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7277530c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:51:24, skipping insertion in model container [2018-11-10 12:51:24,363 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:51:24,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:51:24" (3/3) ... [2018-11-10 12:51:24,364 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.03_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 12:51:24,409 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:51:24,410 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:51:24,410 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:51:24,410 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:51:24,410 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:51:24,410 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:51:24,410 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:51:24,410 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:51:24,411 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:51:24,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-10 12:51:24,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:51:24,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:51:24,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:51:24,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:51:24,450 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:24,450 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:51:24,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-10 12:51:24,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:51:24,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:51:24,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:51:24,453 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:51:24,453 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:24,461 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~ret18;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet16, main_#t~nondet17;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~mem4, test_fun_#t~mem5, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem8, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#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; 29#L551true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 31#L551-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 11#L552true SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 26#L553true assume !(test_fun_#t~mem4 <= 0);havoc test_fun_#t~mem4; 6#L556-11true [2018-11-10 12:51:24,461 INFO L795 eck$LassoCheckResult]: Loop: 6#L556-11true assume true; 22#L556-1true SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 25#L556-2true SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-2 10#L556-3true test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 12#L556-4true assume !test_fun_#t~short10; 3#L556-9true assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9; 4#L557true SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5#L557-1true assume !(test_fun_#t~mem11 <= 0);havoc test_fun_#t~mem11; 32#L560true SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 33#L560-1true SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 19#L560-2true SUMMARY for call write~int(test_fun_#t~mem13 + test_fun_#t~mem14, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560-2 21#L560-3true havoc test_fun_#t~mem13;havoc test_fun_#t~mem14; 6#L556-11true [2018-11-10 12:51:24,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:24,465 INFO L82 PathProgramCache]: Analyzing trace with hash 889444107, now seen corresponding path program 1 times [2018-11-10 12:51:24,467 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:24,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:24,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:24,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:24,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:51:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:51:24,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:24,574 INFO L82 PathProgramCache]: Analyzing trace with hash 969963027, now seen corresponding path program 1 times [2018-11-10 12:51:24,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:24,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:24,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:24,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:24,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:24,613 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 12:51:24,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:51:24,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:51:24,618 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:51:24,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:51:24,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:51:24,629 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-11-10 12:51:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:24,654 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-10 12:51:24,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:51:24,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2018-11-10 12:51:24,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:51:24,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 21 states and 21 transitions. [2018-11-10 12:51:24,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 12:51:24,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 12:51:24,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 21 transitions. [2018-11-10 12:51:24,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:51:24,661 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-10 12:51:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 21 transitions. [2018-11-10 12:51:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 12:51:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 12:51:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-10 12:51:24,681 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-10 12:51:24,681 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-10 12:51:24,681 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:51:24,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 21 transitions. [2018-11-10 12:51:24,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:51:24,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:51:24,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:51:24,682 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:51:24,682 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:24,683 INFO L793 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 82#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~ret18;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet16, main_#t~nondet17;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~mem4, test_fun_#t~mem5, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem8, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#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; 83#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 89#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 87#L552 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 84#L553 assume !(test_fun_#t~mem4 <= 0);havoc test_fun_#t~mem4; 77#L556-11 [2018-11-10 12:51:24,683 INFO L795 eck$LassoCheckResult]: Loop: 77#L556-11 assume true; 79#L556-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 80#L556-2 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-2 81#L556-3 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 85#L556-4 assume test_fun_#t~short10; 88#L556-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-5 90#L556-6 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-6 91#L556-7 test_fun_#t~short10 := test_fun_#t~mem9 <= 2147483647 - test_fun_#t~mem8; 74#L556-9 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9; 75#L557 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 76#L557-1 assume !(test_fun_#t~mem11 <= 0);havoc test_fun_#t~mem11; 78#L560 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 92#L560-1 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 72#L560-2 SUMMARY for call write~int(test_fun_#t~mem13 + test_fun_#t~mem14, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560-2 73#L560-3 havoc test_fun_#t~mem13;havoc test_fun_#t~mem14; 77#L556-11 [2018-11-10 12:51:24,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:24,683 INFO L82 PathProgramCache]: Analyzing trace with hash 889444107, now seen corresponding path program 2 times [2018-11-10 12:51:24,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:24,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:24,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:24,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:24,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:51:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:51:24,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:24,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1109963877, now seen corresponding path program 1 times [2018-11-10 12:51:24,711 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:24,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:24,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:24,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:51:24,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:51:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:51:24,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:24,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1473161243, now seen corresponding path program 1 times [2018-11-10 12:51:24,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:24,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:24,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:51:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:51:24,904 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-11-10 12:51:25,137 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2018-11-10 12:51:25,209 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:51:25,210 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:51:25,210 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:51:25,210 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:51:25,210 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:51:25,210 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:51:25,211 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:51:25,211 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:51:25,211 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.03_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 12:51:25,211 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:51:25,211 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:51:25,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:51:25,238 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 12:51:25,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:51:25,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:51:25,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:51:25,246 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 12:51:25,453 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2018-11-10 12:51:25,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 12:51:25,518 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 12:51:25,520 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 12:51:25,521 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 12:51:25,523 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 12:51:25,524 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 12:51:25,525 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 12:51:25,526 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 12:51:25,528 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 12:51:25,529 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 12:51:25,531 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 12:51:25,532 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 12:51:25,534 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 12:51:25,535 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 12:51:25,536 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 12:51:25,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:51:25,893 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:51:25,897 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:51:25,898 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 12:51:25,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:51:25,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:51:25,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:51:25,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:51:25,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:51:25,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:51:25,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:51:25,903 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:51:25,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 12:51:25,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:51:25,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:51:25,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:51:25,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:51:25,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:51:25,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:51:25,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:51:25,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:51:25,907 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 12:51:25,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:51:25,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:51:25,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:51:25,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:51:25,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:51:25,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:51:25,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:51:25,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:51:25,909 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 12:51:25,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:51:25,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:51:25,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:51:25,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:51:25,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:51:25,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:51:25,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:51:25,910 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:51:25,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 12:51:25,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:51:25,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:51:25,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:51:25,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:51:25,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:51:25,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:51:25,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:51:25,915 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 12:51:25,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:51:25,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:51:25,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:51:25,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:51:25,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:51:25,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:51:25,946 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:51:25,946 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 12:51:25,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:51:25,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:51:25,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:51:25,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:51:25,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:51:25,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:51:25,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:51:25,960 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 12:51:25,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:51:25,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:51:25,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:51:25,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:51:25,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:51:25,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:51:25,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:51:25,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:51:25,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:51:25,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:51:25,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:51:25,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:51:25,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:51:25,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:51:25,970 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:51:25,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:51:25,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:51:25,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:51:25,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:51:25,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:51:25,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:51:25,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:51:25,990 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:51:26,004 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:51:26,004 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:51:26,006 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:51:26,007 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:51:26,007 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:51:26,008 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 2147483647 Supporting invariants [] [2018-11-10 12:51:26,060 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 12:51:26,067 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:51:26,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:26,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:51:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:26,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:51:26,503 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:26,514 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 72 treesize of output 78 [2018-11-10 12:51:26,523 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 73 treesize of output 62 [2018-11-10 12:51:26,525 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:51:26,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:26,593 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:26,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:26,596 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 56 treesize of output 73 [2018-11-10 12:51:26,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:51:26,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 12:51:26,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-11-10 12:51:26,682 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:72, output treesize:172 [2018-11-10 12:51:26,746 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 12:51:26,748 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates [2018-11-10 12:51:26,748 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 21 transitions. cyclomatic complexity: 1 Second operand 16 states. [2018-11-10 12:51:27,125 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 21 transitions. cyclomatic complexity: 1. Second operand 16 states. Result 37 states and 38 transitions. Complement of second has 28 states. [2018-11-10 12:51:27,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2018-11-10 12:51:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 12:51:27,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-11-10 12:51:27,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. Stem has 6 letters. Loop has 15 letters. [2018-11-10 12:51:27,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:51:27,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. Stem has 21 letters. Loop has 15 letters. [2018-11-10 12:51:27,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:51:27,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. Stem has 6 letters. Loop has 30 letters. [2018-11-10 12:51:27,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:51:27,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 38 transitions. [2018-11-10 12:51:27,130 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:51:27,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-11-10 12:51:27,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:51:27,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:51:27,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:51:27,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:51:27,131 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:51:27,131 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:51:27,131 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:51:27,131 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:51:27,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:51:27,131 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:51:27,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:51:27,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:51:27 BoogieIcfgContainer [2018-11-10 12:51:27,135 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:51:27,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:51:27,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:51:27,136 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:51:27,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:51:24" (3/4) ... [2018-11-10 12:51:27,138 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:51:27,139 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:51:27,139 INFO L168 Benchmark]: Toolchain (without parser) took 3464.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -238.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:51:27,140 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:51:27,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.83 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 12:51:27,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -212.7 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:27,141 INFO L168 Benchmark]: Boogie Preprocessor took 19.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:51:27,141 INFO L168 Benchmark]: RCFGBuilder took 247.53 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 12:51:27,141 INFO L168 Benchmark]: BuchiAutomizer took 2777.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -72.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:51:27,142 INFO L168 Benchmark]: Witness Printer took 2.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:51:27,144 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.83 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 75.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -212.7 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 247.53 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 2777.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -72.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 15 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 41 SDtfs, 36 SDslu, 38 SDs, 0 SdLazy, 83 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital218 mio100 ax108 hnf100 lsp88 ukn87 mio100 lsp35 div100 bol100 ite100 ukn100 eq186 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...