./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/array07_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/array07_alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-0ed9222-m [2019-01-14 02:39:50,978 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:39:50,979 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:39:50,997 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:39:50,998 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:39:51,000 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:39:51,001 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:39:51,004 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:39:51,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:39:51,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:39:51,014 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:39:51,014 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:39:51,015 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:39:51,018 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:39:51,026 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:39:51,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:39:51,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:39:51,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:39:51,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:39:51,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:39:51,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:39:51,048 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:39:51,054 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:39:51,054 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:39:51,054 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:39:51,055 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:39:51,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:39:51,059 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:39:51,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:39:51,064 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:39:51,064 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:39:51,065 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:39:51,065 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:39:51,065 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:39:51,066 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:39:51,068 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:39:51,068 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:39:51,094 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:39:51,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:39:51,096 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:39:51,096 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:39:51,096 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:39:51,096 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:39:51,096 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:39:51,096 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:39:51,097 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:39:51,098 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:39:51,098 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:39:51,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:39:51,098 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:39:51,098 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:39:51,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:39:51,099 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:39:51,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:39:51,099 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:39:51,099 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:39:51,099 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:39:51,099 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:39:51,100 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:39:51,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:39:51,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:39:51,101 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:39:51,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:39:51,102 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:39:51,102 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:39:51,104 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:39:51,104 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-14 02:39:51,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:39:51,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:39:51,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:39:51,158 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:39:51,158 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:39:51,159 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/array07_alloca_true-termination.c.i [2019-01-14 02:39:51,208 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f37e2ec07/c851874e11a74b47836948ba5be5dbf4/FLAG008fe448f [2019-01-14 02:39:51,730 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:39:51,731 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/array07_alloca_true-termination.c.i [2019-01-14 02:39:51,742 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f37e2ec07/c851874e11a74b47836948ba5be5dbf4/FLAG008fe448f [2019-01-14 02:39:52,041 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f37e2ec07/c851874e11a74b47836948ba5be5dbf4 [2019-01-14 02:39:52,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:39:52,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:39:52,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:39:52,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:39:52,050 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:39:52,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:39:52" (1/1) ... [2019-01-14 02:39:52,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3540f96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:52, skipping insertion in model container [2019-01-14 02:39:52,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:39:52" (1/1) ... [2019-01-14 02:39:52,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:39:52,111 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:39:52,437 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:39:52,453 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:39:52,572 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:39:52,639 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:39:52,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:52 WrapperNode [2019-01-14 02:39:52,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:39:52,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:39:52,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:39:52,642 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:39:52,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:52" (1/1) ... [2019-01-14 02:39:52,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:52" (1/1) ... [2019-01-14 02:39:52,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:39:52,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:39:52,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:39:52,691 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:39:52,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:52" (1/1) ... [2019-01-14 02:39:52,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:52" (1/1) ... [2019-01-14 02:39:52,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:52" (1/1) ... [2019-01-14 02:39:52,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:52" (1/1) ... [2019-01-14 02:39:52,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:52" (1/1) ... [2019-01-14 02:39:52,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:52" (1/1) ... [2019-01-14 02:39:52,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:52" (1/1) ... [2019-01-14 02:39:52,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:39:52,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:39:52,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:39:52,719 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:39:52,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:39:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:39:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:39:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:39:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:39:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:39:52,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:39:53,091 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:39:53,091 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:39:53,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:39:53 BoogieIcfgContainer [2019-01-14 02:39:53,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:39:53,094 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:39:53,094 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:39:53,098 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:39:53,099 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:39:53,099 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:39:52" (1/3) ... [2019-01-14 02:39:53,100 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c182448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:39:53, skipping insertion in model container [2019-01-14 02:39:53,100 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:39:53,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:52" (2/3) ... [2019-01-14 02:39:53,102 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c182448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:39:53, skipping insertion in model container [2019-01-14 02:39:53,102 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:39:53,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:39:53" (3/3) ... [2019-01-14 02:39:53,104 INFO L375 chiAutomizerObserver]: Analyzing ICFG array07_alloca_true-termination.c.i [2019-01-14 02:39:53,154 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:39:53,155 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:39:53,155 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:39:53,155 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:39:53,155 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:39:53,156 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:39:53,156 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:39:53,156 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:39:53,156 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:39:53,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 02:39:53,196 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-01-14 02:39:53,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:39:53,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:39:53,204 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:39:53,204 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:39:53,205 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:39:53,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 02:39:53,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-01-14 02:39:53,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:39:53,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:39:53,208 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:39:53,208 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:39:53,215 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.allocOnStack(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 [2019-01-14 02:39:53,215 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 [2019-01-14 02:39:53,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:53,221 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-14 02:39:53,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:53,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:53,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:53,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:39:53,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:53,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:53,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-01-14 02:39:53,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:53,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:53,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:53,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:39:53,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:53,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:53,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-01-14 02:39:53,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:53,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:53,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:39:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:53,910 WARN L181 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-01-14 02:39:53,985 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:39:53,986 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:39:53,986 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:39:53,986 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:39:53,986 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:39:53,986 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:39:53,987 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:39:53,987 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:39:53,987 INFO L131 ssoRankerPreferences]: Filename of dumped script: array07_alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:39:53,987 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:39:53,988 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:39:54,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:54,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:54,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:54,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:54,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:54,279 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-14 02:39:54,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:54,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:54,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:54,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:54,491 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-14 02:39:54,674 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 02:39:54,817 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 02:39:55,055 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 02:39:55,089 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:39:55,094 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:39:55,097 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 [2019-01-14 02:39:55,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:55,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:55,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:55,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:55,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:55,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:55,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:55,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:55,106 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 [2019-01-14 02:39:55,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:55,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:55,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:55,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:55,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:55,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:55,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:55,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:55,110 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 [2019-01-14 02:39:55,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:55,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:55,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:55,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:55,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:39:55,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:55,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:55,121 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 [2019-01-14 02:39:55,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:55,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:55,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:55,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:55,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:55,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:55,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:55,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:55,126 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 [2019-01-14 02:39:55,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:55,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:55,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:55,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:55,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:39:55,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:55,203 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:39:55,262 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:39:55,263 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:39:55,266 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:39:55,269 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:39:55,270 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:39:55,271 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset Supporting invariants [] [2019-01-14 02:39:55,291 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:39:55,300 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:39:55,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:39:55,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:39:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:39:55,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:39:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:39:55,452 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 [2019-01-14 02:39:55,453 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-01-14 02:39:55,508 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. [2019-01-14 02:39:55,516 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 [2019-01-14 02:39:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:39:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-01-14 02:39:55,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:39:55,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:39:55,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:39:55,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:39:55,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:39:55,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:39:55,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-01-14 02:39:55,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:39:55,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 10 states and 13 transitions. [2019-01-14 02:39:55,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:39:55,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:39:55,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-14 02:39:55,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:39:55,534 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:39:55,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-14 02:39:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 02:39:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:39:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 02:39:55,563 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:39:55,563 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:39:55,563 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:39:55,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 02:39:55,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:39:55,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:39:55,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:39:55,564 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:39:55,565 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:39:55,565 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.allocOnStack(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 [2019-01-14 02:39:55,565 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~mem209;havoc main_#t~post210; 103#L374-2 [2019-01-14 02:39:55,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:55,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2019-01-14 02:39:55,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:55,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:55,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:55,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:39:55,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:39:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:39:55,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:39:55,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:39:55,661 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:39:55,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:55,662 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2019-01-14 02:39:55,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:55,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:55,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:55,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:39:55,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:55,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:39:55,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:39:55,745 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-14 02:39:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:39:55,785 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-14 02:39:55,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:39:55,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-14 02:39:55,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:39:55,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-01-14 02:39:55,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:39:55,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:39:55,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-01-14 02:39:55,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:39:55,789 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-14 02:39:55,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-01-14 02:39:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-14 02:39:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:39:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-01-14 02:39:55,791 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-14 02:39:55,791 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-14 02:39:55,791 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:39:55,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-01-14 02:39:55,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:39:55,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:39:55,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:39:55,793 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:39:55,793 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:39:55,793 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.allocOnStack(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 [2019-01-14 02:39:55,794 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~mem209;havoc main_#t~post210; 131#L374-2 [2019-01-14 02:39:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:55,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2019-01-14 02:39:55,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:55,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:55,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:55,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:39:55,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:55,816 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2019-01-14 02:39:55,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:55,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:55,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:55,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:39:55,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:55,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:55,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2019-01-14 02:39:55,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:55,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:55,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:55,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:39:55,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:56,324 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-01-14 02:39:56,384 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:39:56,384 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:39:56,384 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:39:56,384 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:39:56,385 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:39:56,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:39:56,385 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:39:56,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:39:56,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: array07_alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:39:56,385 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:39:56,385 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:39:56,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:56,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:56,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:56,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:56,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:56,584 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-01-14 02:39:56,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:56,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:56,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:56,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:39:56,954 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:39:56,955 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:39:56,955 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 [2019-01-14 02:39:56,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:56,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:56,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:56,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:56,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:56,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:56,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:56,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:56,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 [2019-01-14 02:39:56,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:56,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:56,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:56,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:56,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:56,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:56,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:56,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:56,966 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 [2019-01-14 02:39:56,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:56,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:56,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:56,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:56,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:39:56,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:56,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:56,974 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 [2019-01-14 02:39:56,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:56,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:56,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:56,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:56,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:56,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:56,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:56,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:56,979 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 [2019-01-14 02:39:56,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:56,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:56,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:56,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:56,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:39:56,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:56,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:56,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 [2019-01-14 02:39:56,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:56,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:56,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:56,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:56,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:39:56,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:57,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:57,017 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 [2019-01-14 02:39:57,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:57,018 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:39:57,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:57,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:57,022 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:39:57,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:57,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:57,037 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 [2019-01-14 02:39:57,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:57,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:57,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:57,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:57,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:39:57,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:57,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:57,058 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 [2019-01-14 02:39:57,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:57,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:57,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:57,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:57,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:57,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:57,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:57,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:57,063 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 [2019-01-14 02:39:57,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:57,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:57,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:57,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:57,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:57,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:57,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:57,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:57,067 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 [2019-01-14 02:39:57,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:57,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:57,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:57,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:57,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:39:57,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:57,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:57,077 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 [2019-01-14 02:39:57,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:57,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:57,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:57,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:57,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:57,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:57,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:57,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:57,082 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:39:57,082 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 [2019-01-14 02:39:57,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:57,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:57,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:57,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:57,084 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:39:57,084 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:39:57,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:57,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:57,091 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 [2019-01-14 02:39:57,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:57,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:57,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:57,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:57,093 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:39:57,093 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:39:57,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:57,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:57,097 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 [2019-01-14 02:39:57,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:57,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:57,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:57,097 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:39:57,102 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:39:57,102 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:39:57,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:57,108 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 [2019-01-14 02:39:57,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:57,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:57,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:57,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:57,109 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:39:57,112 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:39:57,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:57,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:57,114 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 [2019-01-14 02:39:57,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:57,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:57,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:57,119 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:39:57,121 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:39:57,121 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:39:57,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:57,129 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 [2019-01-14 02:39:57,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:57,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:57,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:57,130 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:39:57,138 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:39:57,138 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:39:57,203 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:39:57,264 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 02:39:57,264 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:39:57,265 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:39:57,267 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2019-01-14 02:39:57,268 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:39:57,268 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 + 8*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_1 f1 = -8*ULTIMATE.start_main_~j~0 + 8*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-01-14 02:39:57,346 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:39:57,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:39:57,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:39:57,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:39:57,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:39:57,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:39:57,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:39:57,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:39:57,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:39:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:39:57,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:39:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:39:57,509 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 [2019-01-14 02:39:57,509 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:39:57,540 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. [2019-01-14 02:39:57,541 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 [2019-01-14 02:39:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:39:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2019-01-14 02:39:57,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 1 letters. [2019-01-14 02:39:57,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:39:57,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 10 letters. Loop has 1 letters. [2019-01-14 02:39:57,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:39:57,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:39:57,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:39:57,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-14 02:39:57,544 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:39:57,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2019-01-14 02:39:57,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:39:57,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:39:57,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:39:57,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:39:57,545 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:39:57,545 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:39:57,545 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:39:57,545 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:39:57,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:39:57,545 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:39:57,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:39:57,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:39:57 BoogieIcfgContainer [2019-01-14 02:39:57,552 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:39:57,553 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:39:57,553 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:39:57,553 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:39:57,554 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:39:53" (3/4) ... [2019-01-14 02:39:57,558 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:39:57,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:39:57,559 INFO L168 Benchmark]: Toolchain (without parser) took 5513.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 947.3 MB in the beginning and 832.6 MB in the end (delta: 114.7 MB). Peak memory consumption was 262.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:39:57,560 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:39:57,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:39:57,562 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.07 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. [2019-01-14 02:39:57,562 INFO L168 Benchmark]: Boogie Preprocessor took 28.39 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:39:57,563 INFO L168 Benchmark]: RCFGBuilder took 373.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:39:57,564 INFO L168 Benchmark]: BuchiAutomizer took 4458.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 832.6 MB in the end (delta: 270.4 MB). Peak memory consumption was 270.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:39:57,565 INFO L168 Benchmark]: Witness Printer took 4.98 ms. Allocated memory is still 1.2 GB. Free memory is still 832.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:39:57,572 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 593.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.07 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 28.39 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 373.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4458.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 832.6 MB in the end (delta: 270.4 MB). Peak memory consumption was 270.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.98 ms. Allocated memory is still 1.2 GB. Free memory is still 832.6 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[arr] + -4 * i + -1 * arr and consists of 5 locations. One deterministic module has 2-nested ranking function (if unknown-#length-unknown[arr] + 8 * unknown-#memory_int-unknown[arr][arr] > 0 then 1 else 0), (if unknown-#length-unknown[arr] + 8 * unknown-#memory_int-unknown[arr][arr] > 0 then unknown-#length-unknown[arr] + 8 * unknown-#memory_int-unknown[arr][arr] else -8 * j + 8 * 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 4.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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: inital112 mio100 ax100 hnf99 lsp94 ukn79 mio100 lsp66 div100 bol100 ite100 ukn100 eq169 hnf91 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 9 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...