./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e9062cd5-1807-4a84-bb01-750275a163cd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e9062cd5-1807-4a84-bb01-750275a163cd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e9062cd5-1807-4a84-bb01-750275a163cd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e9062cd5-1807-4a84-bb01-750275a163cd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e9062cd5-1807-4a84-bb01-750275a163cd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e9062cd5-1807-4a84-bb01-750275a163cd/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 59be66e49b54b8b00b9c1d5bff1f6857d45f8bbd ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:13:14,635 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:13:14,637 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:13:14,643 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:13:14,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:13:14,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:13:14,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:13:14,646 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:13:14,647 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:13:14,648 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:13:14,649 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:13:14,649 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:13:14,650 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:13:14,651 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:13:14,651 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:13:14,652 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:13:14,652 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:13:14,653 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:13:14,655 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:13:14,656 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:13:14,657 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:13:14,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:13:14,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:13:14,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:13:14,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:13:14,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:13:14,662 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:13:14,663 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:13:14,663 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:13:14,664 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:13:14,664 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:13:14,665 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:13:14,665 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:13:14,665 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:13:14,666 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:13:14,667 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:13:14,667 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e9062cd5-1807-4a84-bb01-750275a163cd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 01:13:14,678 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:13:14,678 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:13:14,679 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:13:14,679 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:13:14,679 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:13:14,680 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 01:13:14,680 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 01:13:14,680 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 01:13:14,680 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 01:13:14,680 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 01:13:14,680 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 01:13:14,680 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:13:14,681 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:13:14,681 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:13:14,681 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:13:14,681 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 01:13:14,681 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 01:13:14,681 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 01:13:14,681 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:13:14,681 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 01:13:14,682 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:13:14,682 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 01:13:14,682 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:13:14,684 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:13:14,684 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 01:13:14,684 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:13:14,684 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 01:13:14,685 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 01:13:14,685 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 01:13:14,685 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_e9062cd5-1807-4a84-bb01-750275a163cd/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 -> 59be66e49b54b8b00b9c1d5bff1f6857d45f8bbd [2018-11-23 01:13:14,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:13:14,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:13:14,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:13:14,722 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:13:14,723 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:13:14,723 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e9062cd5-1807-4a84-bb01-750275a163cd/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i [2018-11-23 01:13:14,769 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e9062cd5-1807-4a84-bb01-750275a163cd/bin-2019/uautomizer/data/5affb2c04/84879c6b550e498dbb0aeb36bbaab9c9/FLAGbe3e2e31d [2018-11-23 01:13:15,129 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:13:15,129 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e9062cd5-1807-4a84-bb01-750275a163cd/sv-benchmarks/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i [2018-11-23 01:13:15,138 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e9062cd5-1807-4a84-bb01-750275a163cd/bin-2019/uautomizer/data/5affb2c04/84879c6b550e498dbb0aeb36bbaab9c9/FLAGbe3e2e31d [2018-11-23 01:13:15,525 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e9062cd5-1807-4a84-bb01-750275a163cd/bin-2019/uautomizer/data/5affb2c04/84879c6b550e498dbb0aeb36bbaab9c9 [2018-11-23 01:13:15,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:13:15,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:13:15,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:13:15,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:13:15,531 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:13:15,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:13:15" (1/1) ... [2018-11-23 01:13:15,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667e4ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:15, skipping insertion in model container [2018-11-23 01:13:15,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:13:15" (1/1) ... [2018-11-23 01:13:15,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:13:15,566 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:13:15,757 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:13:15,764 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:13:15,792 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:13:15,866 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:13:15,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:15 WrapperNode [2018-11-23 01:13:15,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:13:15,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:13:15,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:13:15,867 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:13:15,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:15" (1/1) ... [2018-11-23 01:13:15,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:15" (1/1) ... [2018-11-23 01:13:15,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:13:15,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:13:15,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:13:15,904 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:13:15,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:15" (1/1) ... [2018-11-23 01:13:15,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:15" (1/1) ... [2018-11-23 01:13:15,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:15" (1/1) ... [2018-11-23 01:13:15,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:15" (1/1) ... [2018-11-23 01:13:15,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:15" (1/1) ... [2018-11-23 01:13:15,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:15" (1/1) ... [2018-11-23 01:13:15,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:15" (1/1) ... [2018-11-23 01:13:15,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:13:15,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:13:15,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:13:15,924 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:13:15,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9062cd5-1807-4a84-bb01-750275a163cd/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-23 01:13:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:13:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:13:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:13:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:13:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:13:15,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:13:16,110 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:13:16,110 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 01:13:16,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:13:16 BoogieIcfgContainer [2018-11-23 01:13:16,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:13:16,111 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 01:13:16,111 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 01:13:16,114 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 01:13:16,114 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:13:16,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:13:15" (1/3) ... [2018-11-23 01:13:16,115 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2852b895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:13:16, skipping insertion in model container [2018-11-23 01:13:16,115 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:13:16,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:15" (2/3) ... [2018-11-23 01:13:16,115 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2852b895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:13:16, skipping insertion in model container [2018-11-23 01:13:16,115 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:13:16,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:13:16" (3/3) ... [2018-11-23 01:13:16,117 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.16-alloca_true-termination_true-no-overflow.c.i [2018-11-23 01:13:16,151 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:13:16,152 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 01:13:16,152 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 01:13:16,152 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 01:13:16,152 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:13:16,152 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:13:16,152 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 01:13:16,152 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:13:16,152 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 01:13:16,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 01:13:16,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 01:13:16,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:13:16,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:13:16,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 01:13:16,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 01:13:16,184 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 01:13:16,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 01:13:16,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 01:13:16,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:13:16,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:13:16,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 01:13:16,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 01:13:16,190 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;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~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 7#L555-3true [2018-11-23 01:13:16,190 INFO L796 eck$LassoCheckResult]: Loop: 7#L555-3true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 14#L555-1true assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 5#L556-3true assume !true; 8#L556-4true call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 7#L555-3true [2018-11-23 01:13:16,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:13:16,194 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 01:13:16,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:13:16,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:13:16,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:16,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:13:16,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:13:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:13:16,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:13:16,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2018-11-23 01:13:16,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:13:16,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:13:16,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:16,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:13:16,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:13:16,319 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-23 01:13:16,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:13:16,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:13:16,323 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 01:13:16,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 01:13:16,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:13:16,335 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-11-23 01:13:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:13:16,339 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 01:13:16,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 01:13:16,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-11-23 01:13:16,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 01:13:16,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2018-11-23 01:13:16,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 01:13:16,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 01:13:16,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-23 01:13:16,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:13:16,347 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 01:13:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-23 01:13:16,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-23 01:13:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 01:13:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-23 01:13:16,370 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 01:13:16,370 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 01:13:16,370 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 01:13:16,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-23 01:13:16,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 01:13:16,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:13:16,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:13:16,371 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 01:13:16,371 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 01:13:16,371 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;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~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L555-3 [2018-11-23 01:13:16,371 INFO L796 eck$LassoCheckResult]: Loop: 33#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 37#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 34#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 35#L556-1 assume !(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6; 38#L556-4 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 33#L555-3 [2018-11-23 01:13:16,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:13:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 01:13:16,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:13:16,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:13:16,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:16,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:13:16,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:13:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:13:16,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:13:16,396 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2018-11-23 01:13:16,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:13:16,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:13:16,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:16,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:13:16,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:13:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:13:16,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:13:16,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2018-11-23 01:13:16,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:13:16,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:13:16,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:16,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:13:16,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:13:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:13:16,760 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-11-23 01:13:16,846 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 01:13:16,847 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 01:13:16,847 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 01:13:16,847 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 01:13:16,847 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 01:13:16,847 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 01:13:16,847 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 01:13:16,847 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 01:13:16,848 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.16-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-23 01:13:16,848 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 01:13:16,848 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 01:13:16,866 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-23 01:13:16,870 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-23 01:13:16,872 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-23 01:13:16,873 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-23 01:13:16,874 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-23 01:13:17,073 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2018-11-23 01:13:17,134 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-23 01:13:17,136 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-23 01:13:17,138 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-23 01:13:17,147 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-23 01:13:17,149 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-23 01:13:17,150 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-23 01:13:17,152 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-23 01:13:17,153 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-23 01:13:17,155 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-23 01:13:17,424 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 01:13:17,427 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 01:13:17,428 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-23 01:13:17,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:17,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:13:17,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:17,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:17,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:17,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:13:17,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:13:17,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:17,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-23 01:13:17,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:17,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:13:17,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:17,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:17,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:17,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:13:17,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:13:17,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:17,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-23 01:13:17,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:17,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:13:17,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:17,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:17,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:17,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:13:17,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:13:17,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:17,439 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-23 01:13:17,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:17,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:13:17,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:17,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:17,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:17,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:13:17,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:13:17,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:17,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-23 01:13:17,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:17,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:17,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:17,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:17,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:13:17,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:17,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:17,448 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-23 01:13:17,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:17,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:17,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:17,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:17,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:13:17,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:17,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:17,456 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-23 01:13:17,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:17,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:17,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:17,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:17,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:13:17,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:17,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:17,463 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-23 01:13:17,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:17,464 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 01:13:17,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:17,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:17,465 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 01:13:17,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:17,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:17,472 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-23 01:13:17,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:17,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:17,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:17,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:17,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:13:17,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:17,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:17,477 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-23 01:13:17,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:17,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:17,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:17,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:17,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:13:17,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:17,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:17,504 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-23 01:13:17,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:17,505 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 01:13:17,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:17,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:17,507 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 01:13:17,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:17,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:17,514 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-23 01:13:17,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:17,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:17,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:17,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:17,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:13:17,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:17,529 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 01:13:17,535 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 01:13:17,535 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 01:13:17,537 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 01:13:17,538 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 01:13:17,539 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 01:13:17,539 INFO L520 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-23 01:13:17,595 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-23 01:13:17,598 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 01:13:17,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:13:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:13:17,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:13:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:13:17,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:13:17,660 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-23 01:13:17,663 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 01:13:17,664 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-23 01:13:17,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 21 states and 26 transitions. Complement of second has 8 states. [2018-11-23 01:13:17,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 01:13:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 01:13:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-23 01:13:17,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-23 01:13:17,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:13:17,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-23 01:13:17,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:13:17,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-23 01:13:17,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:13:17,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-11-23 01:13:17,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 01:13:17,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 25 transitions. [2018-11-23 01:13:17,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 01:13:17,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 01:13:17,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-23 01:13:17,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 01:13:17,739 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 01:13:17,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-23 01:13:17,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 01:13:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 01:13:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-23 01:13:17,741 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 01:13:17,741 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 01:13:17,741 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 01:13:17,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-23 01:13:17,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 01:13:17,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:13:17,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:13:17,742 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 01:13:17,742 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-23 01:13:17,742 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 188#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;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~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 189#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 196#L555-1 [2018-11-23 01:13:17,742 INFO L796 eck$LassoCheckResult]: Loop: 196#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 190#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 191#L556-1 assume !!(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem7 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem7; 201#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 203#L556-1 assume !(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6; 199#L556-4 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 195#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 196#L555-1 [2018-11-23 01:13:17,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:13:17,743 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-23 01:13:17,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:13:17,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:13:17,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:17,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:13:17,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:13:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:13:17,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:13:17,760 INFO L82 PathProgramCache]: Analyzing trace with hash 15492128, now seen corresponding path program 1 times [2018-11-23 01:13:17,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:13:17,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:13:17,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:17,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:13:17,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:13:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:13:17,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:13:17,772 INFO L82 PathProgramCache]: Analyzing trace with hash 765526557, now seen corresponding path program 1 times [2018-11-23 01:13:17,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:13:17,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:13:17,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:17,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:13:17,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:13:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:13:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:13:18,116 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-23 01:13:18,206 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 01:13:18,206 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 01:13:18,206 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 01:13:18,206 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 01:13:18,206 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 01:13:18,207 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 01:13:18,207 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 01:13:18,207 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 01:13:18,207 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.16-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-23 01:13:18,207 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 01:13:18,207 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 01:13:18,211 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-23 01:13:18,212 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-23 01:13:18,214 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-23 01:13:18,215 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-23 01:13:18,216 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-23 01:13:18,445 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-23 01:13:18,446 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-23 01:13:18,447 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-23 01:13:18,448 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-23 01:13:18,449 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-23 01:13:18,451 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-23 01:13:18,452 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-23 01:13:18,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:13:18,454 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-23 01:13:18,682 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 01:13:18,682 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 01:13:18,683 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-23 01:13:18,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:18,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:13:18,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:18,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:18,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:18,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:13:18,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:13:18,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:18,685 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-23 01:13:18,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:18,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:13:18,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:18,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:18,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:18,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:13:18,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:13:18,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:18,687 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-23 01:13:18,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:18,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:13:18,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:18,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:18,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:18,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:13:18,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:13:18,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:18,688 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-23 01:13:18,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:18,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:18,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:18,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:18,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:13:18,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:18,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:18,691 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-23 01:13:18,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:18,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:18,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:18,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:18,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:13:18,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:18,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:18,695 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-23 01:13:18,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:18,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:18,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:18,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:18,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:13:18,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:18,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:18,702 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-23 01:13:18,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:18,702 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 01:13:18,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:18,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:18,703 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 01:13:18,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:18,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:18,707 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-23 01:13:18,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:18,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:18,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:18,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:18,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:13:18,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:18,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:18,711 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-23 01:13:18,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:18,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:18,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:18,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:18,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:13:18,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:18,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:18,714 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-23 01:13:18,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:18,715 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 01:13:18,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:18,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:18,716 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 01:13:18,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:18,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:18,721 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-23 01:13:18,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:18,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:18,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:18,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:18,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:13:18,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:18,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:18,726 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-23 01:13:18,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:18,726 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 01:13:18,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:18,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:18,727 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 01:13:18,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:18,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:18,731 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-23 01:13:18,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:18,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:18,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:18,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:18,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:13:18,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:18,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:13:18,737 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-23 01:13:18,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:13:18,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:13:18,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:13:18,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:13:18,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:13:18,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:13:18,744 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 01:13:18,748 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 01:13:18,749 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 01:13:18,749 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 01:13:18,750 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 01:13:18,750 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 01:13:18,750 INFO L520 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)_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-23 01:13:18,816 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-23 01:13:18,817 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 01:13:18,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:13:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:13:18,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:13:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:13:18,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:13:18,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:13:18,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 33 [2018-11-23 01:13:18,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:13:18,888 INFO L478 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 33 treesize of output 22 [2018-11-23 01:13:18,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:13:18,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:13:18,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:13:18,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-23 01:13:18,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:13:18,925 INFO L478 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 52 [2018-11-23 01:13:18,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:13:18,930 INFO L478 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 43 treesize of output 36 [2018-11-23 01:13:18,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:13:18,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:13:18,955 INFO L478 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-23 01:13:18,956 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-23 01:13:18,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:13:18,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:13:18,991 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:37 [2018-11-23 01:13:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:13:19,004 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 01:13:19,004 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-23 01:13:19,020 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 37 states and 46 transitions. Complement of second has 6 states. [2018-11-23 01:13:19,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 01:13:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 01:13:19,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-23 01:13:19,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 7 letters. [2018-11-23 01:13:19,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:13:19,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-23 01:13:19,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:13:19,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 14 letters. [2018-11-23 01:13:19,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:13:19,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2018-11-23 01:13:19,022 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 01:13:19,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-11-23 01:13:19,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 01:13:19,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 01:13:19,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 01:13:19,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:13:19,023 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:13:19,023 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:13:19,023 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:13:19,023 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 01:13:19,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 01:13:19,023 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 01:13:19,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 01:13:19,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:13:19 BoogieIcfgContainer [2018-11-23 01:13:19,028 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 01:13:19,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:13:19,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:13:19,028 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:13:19,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:13:16" (3/4) ... [2018-11-23 01:13:19,031 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 01:13:19,031 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:13:19,031 INFO L168 Benchmark]: Toolchain (without parser) took 3503.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.1 MB). Free memory was 950.0 MB in the beginning and 904.8 MB in the end (delta: 45.2 MB). Peak memory consumption was 262.2 MB. Max. memory is 11.5 GB. [2018-11-23 01:13:19,032 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:13:19,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:13:19,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.22 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:13:19,033 INFO L168 Benchmark]: Boogie Preprocessor took 19.73 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:13:19,034 INFO L168 Benchmark]: RCFGBuilder took 187.25 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:13:19,034 INFO L168 Benchmark]: BuchiAutomizer took 2916.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 904.8 MB in the end (delta: 195.3 MB). Peak memory consumption was 278.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:13:19,034 INFO L168 Benchmark]: Witness Printer took 2.83 ms. Allocated memory is still 1.2 GB. Free memory is still 904.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:13:19,036 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.22 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.73 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 187.25 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2916.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 904.8 MB in the end (delta: 195.3 MB). Peak memory consumption was 278.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.83 ms. Allocated memory is still 1.2 GB. Free memory is still 904.8 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/2 HoareTripleCheckerStatistics: 20 SDtfs, 10 SDslu, 5 SDs, 0 SdLazy, 30 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital282 mio100 ax106 hnf100 lsp91 ukn60 mio100 lsp34 div100 bol100 ite100 ukn100 eq188 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 2 VariablesLoop: 0 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...