./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array07_alloca_true-termination.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_3a21c02d-c3e1-4379-ae5e-5e0936d2330e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3a21c02d-c3e1-4379-ae5e-5e0936d2330e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3a21c02d-c3e1-4379-ae5e-5e0936d2330e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3a21c02d-c3e1-4379-ae5e-5e0936d2330e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array07_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3a21c02d-c3e1-4379-ae5e-5e0936d2330e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3a21c02d-c3e1-4379-ae5e-5e0936d2330e/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 77498d00b446eec99f943fd8f68173cd9df2461a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:11:08,791 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:11:08,793 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:11:08,803 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:11:08,804 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:11:08,804 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:11:08,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:11:08,807 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:11:08,808 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:11:08,809 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:11:08,810 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:11:08,810 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:11:08,811 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:11:08,812 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:11:08,813 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:11:08,814 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:11:08,815 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:11:08,816 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:11:08,818 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:11:08,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:11:08,820 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:11:08,821 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:11:08,823 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:11:08,823 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:11:08,824 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:11:08,824 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:11:08,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:11:08,826 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:11:08,827 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:11:08,828 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:11:08,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:11:08,829 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:11:08,829 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:11:08,829 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:11:08,830 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:11:08,830 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:11:08,831 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3a21c02d-c3e1-4379-ae5e-5e0936d2330e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 01:11:08,844 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:11:08,845 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:11:08,846 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:11:08,846 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:11:08,846 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:11:08,846 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 01:11:08,847 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 01:11:08,847 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 01:11:08,847 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 01:11:08,847 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 01:11:08,847 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 01:11:08,847 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:11:08,848 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:11:08,848 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:11:08,848 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:11:08,848 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 01:11:08,848 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 01:11:08,849 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 01:11:08,849 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:11:08,849 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 01:11:08,849 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:11:08,849 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 01:11:08,849 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:11:08,850 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:11:08,850 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 01:11:08,850 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:11:08,850 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 01:11:08,850 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 01:11:08,851 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 01:11:08,851 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_3a21c02d-c3e1-4379-ae5e-5e0936d2330e/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 -> 77498d00b446eec99f943fd8f68173cd9df2461a [2018-11-23 01:11:08,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:11:08,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:11:08,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:11:08,895 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:11:08,895 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:11:08,896 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3a21c02d-c3e1-4379-ae5e-5e0936d2330e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/array07_alloca_true-termination.c.i [2018-11-23 01:11:08,951 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a21c02d-c3e1-4379-ae5e-5e0936d2330e/bin-2019/uautomizer/data/b546879d9/45a56941554a4698a59095632a9135c6/FLAG9ab6201cb [2018-11-23 01:11:09,358 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:11:09,358 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3a21c02d-c3e1-4379-ae5e-5e0936d2330e/sv-benchmarks/c/termination-15/array07_alloca_true-termination.c.i [2018-11-23 01:11:09,367 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a21c02d-c3e1-4379-ae5e-5e0936d2330e/bin-2019/uautomizer/data/b546879d9/45a56941554a4698a59095632a9135c6/FLAG9ab6201cb [2018-11-23 01:11:09,378 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3a21c02d-c3e1-4379-ae5e-5e0936d2330e/bin-2019/uautomizer/data/b546879d9/45a56941554a4698a59095632a9135c6 [2018-11-23 01:11:09,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:11:09,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:11:09,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:11:09,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:11:09,387 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:11:09,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:11:09" (1/1) ... [2018-11-23 01:11:09,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bcd9fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:09, skipping insertion in model container [2018-11-23 01:11:09,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:11:09" (1/1) ... [2018-11-23 01:11:09,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:11:09,435 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:11:09,711 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:11:09,721 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:11:09,824 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:11:09,860 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:11:09,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:09 WrapperNode [2018-11-23 01:11:09,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:11:09,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:11:09,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:11:09,862 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:11:09,868 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:11:09" (1/1) ... [2018-11-23 01:11:09,879 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:11:09" (1/1) ... [2018-11-23 01:11:09,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:11:09,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:11:09,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:11:09,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:11:09,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:09" (1/1) ... [2018-11-23 01:11:09,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:09" (1/1) ... [2018-11-23 01:11:09,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:09" (1/1) ... [2018-11-23 01:11:09,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:09" (1/1) ... [2018-11-23 01:11:09,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:09" (1/1) ... [2018-11-23 01:11:09,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:09" (1/1) ... [2018-11-23 01:11:09,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:09" (1/1) ... [2018-11-23 01:11:09,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:11:09,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:11:09,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:11:09,916 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:11:09,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a21c02d-c3e1-4379-ae5e-5e0936d2330e/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:11:09,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:11:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:11:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:11:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:11:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:11:09,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:11:10,134 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:11:10,134 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 01:11:10,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:10 BoogieIcfgContainer [2018-11-23 01:11:10,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:11:10,135 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 01:11:10,135 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 01:11:10,139 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 01:11:10,139 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:11:10,140 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:11:09" (1/3) ... [2018-11-23 01:11:10,141 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3896f140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:11:10, skipping insertion in model container [2018-11-23 01:11:10,141 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:11:10,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:09" (2/3) ... [2018-11-23 01:11:10,141 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3896f140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:11:10, skipping insertion in model container [2018-11-23 01:11:10,141 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:11:10,142 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:10" (3/3) ... [2018-11-23 01:11:10,143 INFO L375 chiAutomizerObserver]: Analyzing ICFG array07_alloca_true-termination.c.i [2018-11-23 01:11:10,199 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:11:10,200 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 01:11:10,200 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 01:11:10,200 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 01:11:10,200 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:11:10,200 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:11:10,200 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 01:11:10,201 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:11:10,201 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 01:11:10,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 01:11:10,234 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-23 01:11:10,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:11:10,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:11:10,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 01:11:10,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 01:11:10,243 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 01:11:10,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 01:11:10,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-23 01:11:10,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:11:10,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:11:10,245 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 01:11:10,245 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 01:11:10,255 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 14#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 11#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 15#L370-3true [2018-11-23 01:11:10,256 INFO L796 eck$LassoCheckResult]: Loop: 15#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208; 13#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L370-3true [2018-11-23 01:11:10,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:10,262 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-23 01:11:10,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:11:10,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:11:10,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:10,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:11:10,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:11:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:11:10,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:10,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2018-11-23 01:11:10,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:11:10,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:11:10,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:10,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:11:10,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:11:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:11:10,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:10,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2018-11-23 01:11:10,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:11:10,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:11:10,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:10,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:11:10,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:11:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:11:10,629 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 01:11:10,630 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 01:11:10,631 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 01:11:10,631 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 01:11:10,631 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 01:11:10,631 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 01:11:10,631 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 01:11:10,631 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 01:11:10,632 INFO L131 ssoRankerPreferences]: Filename of dumped script: array07_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-23 01:11:10,632 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 01:11:10,632 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 01:11:10,652 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:11:10,657 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:11:10,661 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:11:10,663 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:11:10,666 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:11:10,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:11:10,744 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:11:10,745 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:11:10,749 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:11:10,938 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 01:11:10,942 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 01:11:10,944 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:11:10,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:10,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:11:10,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:10,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:10,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:10,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:11:10,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:11:10,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:10,957 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:11:10,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:10,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:11:10,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:10,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:10,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:10,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:11:10,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:11:10,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:10,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 01:11:10,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:10,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:11:10,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:10,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:10,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:10,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:11:10,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:11:10,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:10,964 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:11:10,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:10,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:10,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:10,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:10,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:11:10,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:11:10,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:10,973 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:11:10,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:10,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:10,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:10,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:10,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:11:10,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:11:11,031 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 01:11:11,053 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 01:11:11,053 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 01:11:11,056 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 01:11:11,059 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 01:11:11,060 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 01:11:11,060 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2018-11-23 01:11:11,088 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 01:11:11,096 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 01:11:11,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:11:11,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:11:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:11:11,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:11:11,157 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:11:11,169 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 01:11:11,170 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2018-11-23 01:11:11,213 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 7 states. [2018-11-23 01:11:11,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 01:11:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 01:11:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-23 01:11:11,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 01:11:11,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:11:11,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 01:11:11,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:11:11,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 01:11:11,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:11:11,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-11-23 01:11:11,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 01:11:11,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 10 states and 13 transitions. [2018-11-23 01:11:11,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 01:11:11,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 01:11:11,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-23 01:11:11,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:11:11,228 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 01:11:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-23 01:11:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-23 01:11:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 01:11:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 01:11:11,248 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 01:11:11,248 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 01:11:11,248 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 01:11:11,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 01:11:11,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 01:11:11,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:11:11,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:11:11,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:11:11,249 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 01:11:11,250 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 105#L367 assume !(main_~length~0 < 1); 108#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 109#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 110#L370-3 assume !(main_~i~0 < main_~length~0); 106#L370-4 main_~j~0 := 0; 103#L374-2 [2018-11-23 01:11:11,250 INFO L796 eck$LassoCheckResult]: Loop: 103#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; 103#L374-2 [2018-11-23 01:11:11,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:11,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2018-11-23 01:11:11,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:11:11,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:11:11,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:11,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:11:11,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:11:11,306 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:11:11,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:11:11,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:11:11,309 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 01:11:11,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:11,310 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2018-11-23 01:11:11,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:11:11,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:11:11,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:11,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:11:11,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:11:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:11:11,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:11:11,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:11:11,355 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-23 01:11:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:11:11,389 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-11-23 01:11:11,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:11:11,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-11-23 01:11:11,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 01:11:11,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2018-11-23 01:11:11,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 01:11:11,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 01:11:11,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-23 01:11:11,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:11:11,392 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-23 01:11:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-23 01:11:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-23 01:11:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 01:11:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-23 01:11:11,394 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-23 01:11:11,394 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-23 01:11:11,394 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 01:11:11,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-23 01:11:11,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 01:11:11,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:11:11,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:11:11,395 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:11:11,395 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 01:11:11,396 INFO L794 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 133#L367 assume !(main_~length~0 < 1); 136#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 137#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208; 139#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 140#L370-3 assume !(main_~i~0 < main_~length~0); 134#L370-4 main_~j~0 := 0; 131#L374-2 [2018-11-23 01:11:11,396 INFO L796 eck$LassoCheckResult]: Loop: 131#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; 131#L374-2 [2018-11-23 01:11:11,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:11,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2018-11-23 01:11:11,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:11:11,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:11:11,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:11,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:11:11,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:11:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:11:11,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2018-11-23 01:11:11,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:11:11,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:11:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:11,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:11:11,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:11:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:11:11,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:11,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2018-11-23 01:11:11,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:11:11,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:11:11,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:11,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:11:11,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:11:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:11:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:11:11,633 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 01:11:11,633 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 01:11:11,633 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 01:11:11,633 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 01:11:11,633 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 01:11:11,633 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 01:11:11,634 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 01:11:11,634 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 01:11:11,634 INFO L131 ssoRankerPreferences]: Filename of dumped script: array07_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 01:11:11,634 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 01:11:11,634 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 01:11:11,636 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:11:11,643 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:11:11,645 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:11:11,648 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:11:11,650 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:11:11,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:11:11,729 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:11:11,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:11:11,732 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:11:11,882 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 01:11:11,882 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 01:11:11,882 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:11:11,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:11:11,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:11,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:11:11,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:11:11,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,885 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:11:11,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:11:11,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:11,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:11:11,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:11:11,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,888 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:11:11,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:11:11,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:11,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:11:11,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:11:11,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 01:11:11,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:11,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:11:11,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:11:11,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,896 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:11:11,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,897 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 01:11:11,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:11,899 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 01:11:11,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:11:11,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,908 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:11:11,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:11,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:11:11,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:11:11,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,914 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:11:11,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:11,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:11:11,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:11:11,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,926 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:11:11,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:11,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:11:11,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:11:11,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,951 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:11:11,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:11:11,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:11,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:11:11,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:11:11,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,954 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:11:11,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:11:11,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:11,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:11:11,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:11:11,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,957 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:11:11,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:11,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:11:11,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:11:11,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,961 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:11:11,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:11:11,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:11:11,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:11:11,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:11:11,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,964 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 01:11:11,964 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:11:11,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:11:11,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,965 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 01:11:11,965 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 01:11:11,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:11:11,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 01:11:11,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:11:11,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,968 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 01:11:11,968 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 01:11:11,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:11:11,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,973 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:11:11,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:11:11,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,974 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 01:11:11,974 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 01:11:11,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:11:11,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 01:11:11,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,976 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 01:11:11,978 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 01:11:11,979 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 01:11:11,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 01:11:11,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,988 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 01:11:11,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,988 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 01:11:11,990 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 01:11:11,990 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 01:11:11,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:11,997 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:11:11,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:11,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:11,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:11,999 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 01:11:12,000 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 01:11:12,000 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 01:11:12,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:12,002 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:11:12,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:12,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:12,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:12,003 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 01:11:12,005 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 01:11:12,005 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 01:11:12,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:11:12,015 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:11:12,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:11:12,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:11:12,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:11:12,016 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 01:11:12,022 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 01:11:12,022 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 01:11:12,044 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 01:11:12,081 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 01:11:12,081 INFO L444 ModelExtractionUtils]: 37 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 01:11:12,081 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 01:11:12,083 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2018-11-23 01:11:12,083 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 01:11:12,083 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_1 + 1 f1 = -2*ULTIMATE.start_main_~j~0 + 2*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-23 01:11:12,108 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 01:11:12,110 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 01:11:12,111 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 01:11:12,112 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 01:11:12,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:11:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:11:12,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:11:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:11:12,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:11:12,165 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:11:12,166 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-23 01:11:12,166 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 2 states. [2018-11-23 01:11:12,174 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 13 transitions. Complement of second has 2 states. [2018-11-23 01:11:12,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-23 01:11:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 01:11:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2018-11-23 01:11:12,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 1 letters. [2018-11-23 01:11:12,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:11:12,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 10 letters. Loop has 1 letters. [2018-11-23 01:11:12,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:11:12,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 01:11:12,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:11:12,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-11-23 01:11:12,177 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 01:11:12,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2018-11-23 01:11:12,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 01:11:12,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 01:11:12,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 01:11:12,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:11:12,178 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:11:12,178 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:11:12,178 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:11:12,178 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 01:11:12,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 01:11:12,178 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 01:11:12,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 01:11:12,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:11:12 BoogieIcfgContainer [2018-11-23 01:11:12,190 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 01:11:12,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:11:12,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:11:12,191 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:11:12,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:10" (3/4) ... [2018-11-23 01:11:12,195 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 01:11:12,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:11:12,196 INFO L168 Benchmark]: Toolchain (without parser) took 2814.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 957.5 MB in the beginning and 845.9 MB in the end (delta: 111.6 MB). Peak memory consumption was 250.6 MB. Max. memory is 11.5 GB. [2018-11-23 01:11:12,198 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:11:12,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-11-23 01:11:12,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:11:12,199 INFO L168 Benchmark]: Boogie Preprocessor took 19.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:11:12,200 INFO L168 Benchmark]: RCFGBuilder took 219.51 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: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:11:12,200 INFO L168 Benchmark]: BuchiAutomizer took 2055.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 845.9 MB in the end (delta: 251.3 MB). Peak memory consumption was 251.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:11:12,201 INFO L168 Benchmark]: Witness Printer took 4.63 ms. Allocated memory is still 1.2 GB. Free memory is still 845.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:11:12,204 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 478.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 219.51 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: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2055.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 845.9 MB in the end (delta: 251.3 MB). Peak memory consumption was 251.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.63 ms. Allocated memory is still 1.2 GB. Free memory is still 845.9 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * arr + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has 2-nested ranking function (if 2 * unknown-#memory_int-unknown[arr][arr] + 1 > 0 then 1 else 0), (if 2 * unknown-#memory_int-unknown[arr][arr] + 1 > 0 then 2 * unknown-#memory_int-unknown[arr][arr] + 1 else -2 * j + 2 * length) and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. 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 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30 SDtfs, 33 SDslu, 12 SDs, 0 SdLazy, 23 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf99 lsp94 ukn77 mio100 lsp68 div100 bol100 ite100 ukn100 eq171 hnf90 smp91 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 12 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...