./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.05-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_df68447b-37fa-4c12-839a-02e67b518761/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_df68447b-37fa-4c12-839a-02e67b518761/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_df68447b-37fa-4c12-839a-02e67b518761/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_df68447b-37fa-4c12-839a-02e67b518761/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.05-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_df68447b-37fa-4c12-839a-02e67b518761/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_df68447b-37fa-4c12-839a-02e67b518761/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 f1e9ba7e316537618e1819aa49662575d0a5a8e7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:23:34,013 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:23:34,015 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:23:34,022 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:23:34,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:23:34,023 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:23:34,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:23:34,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:23:34,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:23:34,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:23:34,027 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:23:34,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:23:34,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:23:34,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:23:34,029 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:23:34,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:23:34,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:23:34,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:23:34,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:23:34,034 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:23:34,034 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:23:34,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:23:34,037 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:23:34,037 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:23:34,037 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:23:34,038 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:23:34,038 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:23:34,039 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:23:34,039 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:23:34,040 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:23:34,040 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:23:34,041 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:23:34,041 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:23:34,042 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:23:34,042 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:23:34,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:23:34,043 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_df68447b-37fa-4c12-839a-02e67b518761/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:23:34,053 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:23:34,054 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:23:34,054 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:23:34,055 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:23:34,055 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:23:34,055 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:23:34,055 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:23:34,055 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:23:34,055 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:23:34,056 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:23:34,056 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:23:34,056 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:23:34,056 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:23:34,056 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:23:34,056 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:23:34,056 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:23:34,057 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:23:34,057 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:23:34,057 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:23:34,058 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:23:34,058 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:23:34,059 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:23:34,059 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:23:34,059 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:23:34,059 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:23:34,059 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:23:34,059 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:23:34,059 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:23:34,060 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:23:34,060 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_df68447b-37fa-4c12-839a-02e67b518761/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 -> f1e9ba7e316537618e1819aa49662575d0a5a8e7 [2018-11-18 12:23:34,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:23:34,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:23:34,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:23:34,094 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:23:34,095 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:23:34,095 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_df68447b-37fa-4c12-839a-02e67b518761/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.05-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:23:34,129 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_df68447b-37fa-4c12-839a-02e67b518761/bin-2019/uautomizer/data/812191421/eff4c7be78114ad5a68ebc32522f06be/FLAG7a7c715e5 [2018-11-18 12:23:34,547 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:23:34,547 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_df68447b-37fa-4c12-839a-02e67b518761/sv-benchmarks/c/termination-memory-alloca/b.05-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:23:34,553 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_df68447b-37fa-4c12-839a-02e67b518761/bin-2019/uautomizer/data/812191421/eff4c7be78114ad5a68ebc32522f06be/FLAG7a7c715e5 [2018-11-18 12:23:34,561 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_df68447b-37fa-4c12-839a-02e67b518761/bin-2019/uautomizer/data/812191421/eff4c7be78114ad5a68ebc32522f06be [2018-11-18 12:23:34,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:23:34,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:23:34,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:23:34,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:23:34,566 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:23:34,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:23:34" (1/1) ... [2018-11-18 12:23:34,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3356d25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:34, skipping insertion in model container [2018-11-18 12:23:34,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:23:34" (1/1) ... [2018-11-18 12:23:34,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:23:34,598 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:23:34,777 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:23:34,784 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:23:34,811 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:23:34,884 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:23:34,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:34 WrapperNode [2018-11-18 12:23:34,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:23:34,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:23:34,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:23:34,885 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:23:34,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:34" (1/1) ... [2018-11-18 12:23:34,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:34" (1/1) ... [2018-11-18 12:23:34,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:23:34,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:23:34,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:23:34,921 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:23:34,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:34" (1/1) ... [2018-11-18 12:23:34,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:34" (1/1) ... [2018-11-18 12:23:34,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:34" (1/1) ... [2018-11-18 12:23:34,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:34" (1/1) ... [2018-11-18 12:23:34,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:34" (1/1) ... [2018-11-18 12:23:34,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:34" (1/1) ... [2018-11-18 12:23:34,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:34" (1/1) ... [2018-11-18 12:23:34,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:23:34,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:23:34,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:23:34,942 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:23:34,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df68447b-37fa-4c12-839a-02e67b518761/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-18 12:23:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:23:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:23:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:23:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:23:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:23:34,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:23:35,155 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:23:35,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:23:35 BoogieIcfgContainer [2018-11-18 12:23:35,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:23:35,156 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:23:35,156 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:23:35,159 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:23:35,159 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:23:35,160 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:23:34" (1/3) ... [2018-11-18 12:23:35,160 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5009e2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:23:35, skipping insertion in model container [2018-11-18 12:23:35,160 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:23:35,161 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:23:34" (2/3) ... [2018-11-18 12:23:35,161 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5009e2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:23:35, skipping insertion in model container [2018-11-18 12:23:35,161 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:23:35,161 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:23:35" (3/3) ... [2018-11-18 12:23:35,162 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.05-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:23:35,197 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:23:35,198 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:23:35,198 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:23:35,198 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:23:35,198 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:23:35,198 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:23:35,198 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:23:35,198 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:23:35,198 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:23:35,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 12:23:35,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:23:35,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:23:35,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:23:35,228 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:23:35,228 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:35,228 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:23:35,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 12:23:35,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:23:35,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:23:35,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:23:35,229 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:23:35,229 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:35,234 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;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~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;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_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 8#L554-12true [2018-11-18 12:23:35,235 INFO L796 eck$LassoCheckResult]: Loop: 8#L554-12true assume true; 7#L554-1true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 10#L554-2true assume test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 >= 0; 14#L554-4true test_fun_#t~short9 := test_fun_#t~short7; 16#L554-5true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3#L554-7true test_fun_#t~short11 := test_fun_#t~short9; 4#L554-8true assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 5#L554-10true assume !!test_fun_#t~short11;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short11;havoc test_fun_#t~short7;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 8#L554-12true [2018-11-18 12:23:35,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:35,239 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 12:23:35,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:35,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:35,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:35,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:35,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:35,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:35,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1101100525, now seen corresponding path program 1 times [2018-11-18 12:23:35,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:35,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:35,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:35,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:35,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:35,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:35,360 INFO L82 PathProgramCache]: Analyzing trace with hash -410539051, now seen corresponding path program 1 times [2018-11-18 12:23:35,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:35,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:35,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:35,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:35,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:35,622 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2018-11-18 12:23:35,807 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-11-18 12:23:35,858 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:23:35,859 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:23:35,859 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:23:35,859 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:23:35,859 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:23:35,859 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:23:35,860 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:23:35,860 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:23:35,860 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.05-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-18 12:23:35,860 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:23:35,860 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:23:35,878 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-18 12:23:35,881 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-18 12:23:35,883 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-18 12:23:35,884 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-18 12:23:35,885 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-18 12:23:35,888 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-18 12:23:35,889 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-18 12:23:35,892 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-18 12:23:35,894 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-18 12:23:35,895 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-18 12:23:35,898 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-18 12:23:35,899 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-18 12:23:35,901 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-18 12:23:35,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:23:36,082 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-18 12:23:36,083 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-18 12:23:36,085 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-18 12:23:36,086 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-18 12:23:36,087 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-18 12:23:36,089 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-18 12:23:36,328 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:23:36,332 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:23:36,334 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-18 12:23:36,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:36,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:36,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:36,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,339 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-18 12:23:36,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:36,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:36,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:36,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:23:36,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:36,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:36,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:36,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,346 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-18 12:23:36,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:36,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:36,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:36,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,349 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-18 12:23:36,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:36,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:36,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,355 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-18 12:23:36,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:36,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:36,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:36,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,358 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-18 12:23:36,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:36,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:36,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:36,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,360 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-18 12:23:36,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:36,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:36,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:36,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,365 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-18 12:23:36,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:36,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:36,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:36,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:23:36,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:36,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:36,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,376 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-18 12:23:36,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:36,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:36,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,384 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-18 12:23:36,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:23:36,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:23:36,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:23:36,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:23:36,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:36,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:36,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,392 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-18 12:23:36,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:36,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:36,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,407 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-18 12:23:36,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:36,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:36,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,418 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-18 12:23:36,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,418 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:23:36,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,420 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:23:36,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:36,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,429 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-18 12:23:36,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:36,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:36,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,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-18 12:23:36,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:36,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:36,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,440 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-18 12:23:36,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,440 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:23:36,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,443 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:23:36,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:36,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:23:36,450 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-18 12:23:36,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:23:36,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:23:36,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:23:36,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:23:36,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:23:36,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:23:36,472 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:23:36,486 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:23:36,486 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 12:23:36,488 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:23:36,490 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:23:36,490 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:23:36,491 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-18 12:23:36,519 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 12:23:36,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:23:36,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:36,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:36,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:23:36,619 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-18 12:23:36,628 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-18 12:23:36,629 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 5 states. [2018-11-18 12:23:36,697 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 5 states. Result 44 states and 58 transitions. Complement of second has 10 states. [2018-11-18 12:23:36,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 12:23:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 12:23:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-18 12:23:36,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-18 12:23:36,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:36,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-18 12:23:36,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:36,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-18 12:23:36,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:23:36,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 58 transitions. [2018-11-18 12:23:36,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:23:36,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 26 states and 35 transitions. [2018-11-18 12:23:36,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:23:36,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 12:23:36,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2018-11-18 12:23:36,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:23:36,708 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-18 12:23:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2018-11-18 12:23:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-18 12:23:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 12:23:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-11-18 12:23:36,725 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-18 12:23:36,725 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-18 12:23:36,725 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:23:36,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2018-11-18 12:23:36,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:23:36,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:23:36,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:23:36,726 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:23:36,726 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:36,727 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;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~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;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_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 171#L554-12 assume true; 172#L554-1 [2018-11-18 12:23:36,727 INFO L796 eck$LassoCheckResult]: Loop: 172#L554-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 173#L554-2 assume !test_fun_#t~short7; 183#L554-4 test_fun_#t~short9 := test_fun_#t~short7; 188#L554-5 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 178#L554-7 test_fun_#t~short11 := test_fun_#t~short9; 179#L554-8 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 186#L554-10 assume !!test_fun_#t~short11;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short11;havoc test_fun_#t~short7;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 176#L554-12 assume true; 172#L554-1 [2018-11-18 12:23:36,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:36,727 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 12:23:36,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:36,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:36,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:36,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:36,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:36,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:36,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1650486607, now seen corresponding path program 1 times [2018-11-18 12:23:36,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:36,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:36,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:36,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:36,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:36,788 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-18 12:23:36,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:36,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:23:36,791 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:23:36,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:23:36,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:23:36,795 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 12:23:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:36,831 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2018-11-18 12:23:36,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:23:36,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 36 transitions. [2018-11-18 12:23:36,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:23:36,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 36 transitions. [2018-11-18 12:23:36,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:23:36,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 12:23:36,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2018-11-18 12:23:36,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:23:36,835 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-18 12:23:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2018-11-18 12:23:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-18 12:23:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 12:23:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-11-18 12:23:36,837 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-18 12:23:36,837 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-18 12:23:36,837 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:23:36,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2018-11-18 12:23:36,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:23:36,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:23:36,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:23:36,838 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:23:36,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:23:36,839 INFO L794 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 232#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;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~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;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_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 233#L554-12 assume true; 234#L554-1 [2018-11-18 12:23:36,839 INFO L796 eck$LassoCheckResult]: Loop: 234#L554-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 235#L554-2 assume !test_fun_#t~short7; 245#L554-4 test_fun_#t~short9 := test_fun_#t~short7; 250#L554-5 assume !test_fun_#t~short9; 241#L554-7 test_fun_#t~short11 := test_fun_#t~short9; 242#L554-8 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 248#L554-10 assume !!test_fun_#t~short11;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short11;havoc test_fun_#t~short7;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 238#L554-12 assume true; 234#L554-1 [2018-11-18 12:23:36,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:36,839 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 2 times [2018-11-18 12:23:36,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:36,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:36,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:36,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:23:36,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:23:36,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:23:36,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1648639565, now seen corresponding path program 1 times [2018-11-18 12:23:36,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:23:36,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:23:36,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:36,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:23:36,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:23:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:23:36,892 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-18 12:23:36,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:23:36,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:23:36,893 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:23:36,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:23:36,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:23:36,893 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-18 12:23:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:23:36,913 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-18 12:23:36,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:23:36,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2018-11-18 12:23:36,914 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:23:36,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2018-11-18 12:23:36,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:23:36,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:23:36,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:23:36,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:23:36,915 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:23:36,915 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:23:36,915 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:23:36,915 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:23:36,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:23:36,915 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:23:36,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:23:36,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:23:36 BoogieIcfgContainer [2018-11-18 12:23:36,919 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:23:36,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:23:36,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:23:36,920 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:23:36,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:23:35" (3/4) ... [2018-11-18 12:23:36,923 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:23:36,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:23:36,924 INFO L168 Benchmark]: Toolchain (without parser) took 2360.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 240.1 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -270.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:23:36,925 INFO L168 Benchmark]: CDTParser took 0.11 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-18 12:23:36,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -206.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:23:36,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:23:36,926 INFO L168 Benchmark]: Boogie Preprocessor took 20.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:23:36,926 INFO L168 Benchmark]: RCFGBuilder took 214.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:23:36,926 INFO L168 Benchmark]: BuchiAutomizer took 1763.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:23:36,927 INFO L168 Benchmark]: Witness Printer took 3.73 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:23:36,929 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.11 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 320.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -206.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 214.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1763.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.73 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 39 SDslu, 41 SDs, 0 SdLazy, 48 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital219 mio100 ax108 hnf100 lsp87 ukn64 mio100 lsp37 div100 bol100 ite100 ukn100 eq172 hnf89 smp92 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...