./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/array04_alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/array04_alloca_false-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 ede187b1b02320b6ac4ee708403ec99e5631a2e0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:05:09,785 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:05:09,787 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:05:09,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:05:09,802 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:05:09,803 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:05:09,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:05:09,811 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:05:09,816 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:05:09,817 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:05:09,821 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:05:09,821 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:05:09,822 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:05:09,825 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:05:09,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:05:09,828 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:05:09,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:05:09,831 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:05:09,833 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:05:09,835 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:05:09,836 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:05:09,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:05:09,840 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:05:09,841 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:05:09,841 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:05:09,842 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:05:09,843 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:05:09,844 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:05:09,846 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:05:09,847 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:05:09,847 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:05:09,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:05:09,848 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:05:09,849 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:05:09,850 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:05:09,851 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:05:09,851 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:05:09,884 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:05:09,885 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:05:09,886 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:05:09,886 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:05:09,886 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:05:09,887 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:05:09,887 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:05:09,887 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:05:09,888 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:05:09,888 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:05:09,888 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:05:09,888 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:05:09,888 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:05:09,889 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:05:09,889 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:05:09,890 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:05:09,890 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:05:09,891 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:05:09,891 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:05:09,891 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:05:09,891 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:05:09,891 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:05:09,892 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:05:09,892 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:05:09,892 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:05:09,892 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:05:09,892 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:05:09,892 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:05:09,893 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:05:09,895 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 -> ede187b1b02320b6ac4ee708403ec99e5631a2e0 [2019-01-01 22:05:09,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:05:09,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:05:09,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:05:09,976 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:05:09,978 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:05:09,978 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/array04_alloca_false-termination.c.i [2019-01-01 22:05:10,048 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/578bfa7ac/4232ce5b542840448afe98c5c05134a2/FLAGf8f8432f5 [2019-01-01 22:05:10,580 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:05:10,581 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/array04_alloca_false-termination.c.i [2019-01-01 22:05:10,591 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/578bfa7ac/4232ce5b542840448afe98c5c05134a2/FLAGf8f8432f5 [2019-01-01 22:05:10,847 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/578bfa7ac/4232ce5b542840448afe98c5c05134a2 [2019-01-01 22:05:10,850 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:05:10,852 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:05:10,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:05:10,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:05:10,857 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:05:10,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:05:10" (1/1) ... [2019-01-01 22:05:10,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31582b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:10, skipping insertion in model container [2019-01-01 22:05:10,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:05:10" (1/1) ... [2019-01-01 22:05:10,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:05:10,915 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:05:11,311 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:05:11,324 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:05:11,390 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:05:11,540 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:05:11,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:11 WrapperNode [2019-01-01 22:05:11,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:05:11,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:05:11,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:05:11,542 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:05:11,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:11" (1/1) ... [2019-01-01 22:05:11,570 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:11" (1/1) ... [2019-01-01 22:05:11,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:05:11,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:05:11,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:05:11,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:05:11,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:11" (1/1) ... [2019-01-01 22:05:11,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:11" (1/1) ... [2019-01-01 22:05:11,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:11" (1/1) ... [2019-01-01 22:05:11,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:11" (1/1) ... [2019-01-01 22:05:11,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:11" (1/1) ... [2019-01-01 22:05:11,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:11" (1/1) ... [2019-01-01 22:05:11,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:11" (1/1) ... [2019-01-01 22:05:11,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:05:11,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:05:11,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:05:11,625 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:05:11,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:11" (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-01 22:05:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:05:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:05:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:05:11,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:05:11,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:05:11,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:05:12,186 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:05:12,186 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 22:05:12,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:12 BoogieIcfgContainer [2019-01-01 22:05:12,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:05:12,188 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:05:12,188 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:05:12,193 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:05:12,195 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:12,195 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:05:10" (1/3) ... [2019-01-01 22:05:12,196 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a8e523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:05:12, skipping insertion in model container [2019-01-01 22:05:12,196 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:12,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:11" (2/3) ... [2019-01-01 22:05:12,197 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a8e523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:05:12, skipping insertion in model container [2019-01-01 22:05:12,197 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:12,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:12" (3/3) ... [2019-01-01 22:05:12,200 INFO L375 chiAutomizerObserver]: Analyzing ICFG array04_alloca_false-termination.c.i [2019-01-01 22:05:12,273 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:05:12,274 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:05:12,274 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:05:12,274 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:05:12,275 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:05:12,275 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:05:12,275 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:05:12,275 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:05:12,276 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:05:12,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 22:05:12,358 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-01-01 22:05:12,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:12,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:12,367 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:05:12,367 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:05:12,367 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:05:12,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 22:05:12,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-01-01 22:05:12,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:12,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:12,370 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:05:12,370 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:05:12,378 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_~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-01 22:05:12,379 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-01 22:05:12,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:12,387 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-01 22:05:12,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:12,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:12,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:12,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:12,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:12,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:12,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-01-01 22:05:12,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:12,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:12,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:12,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:12,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-01-01 22:05:12,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:12,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:12,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:12,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:12,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:12,977 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-01-01 22:05:13,078 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:13,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:13,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:13,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:13,080 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:13,081 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:13,081 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:13,081 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:13,081 INFO L131 ssoRankerPreferences]: Filename of dumped script: array04_alloca_false-termination.c.i_Iteration1_Lasso [2019-01-01 22:05:13,081 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:13,082 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:13,109 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-01 22:05:13,122 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-01 22:05:13,155 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-01 22:05:13,185 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-01 22:05:13,188 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-01 22:05:13,474 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-01 22:05:13,543 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-01 22:05:13,546 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-01 22:05:13,552 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-01 22:05:13,850 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 22:05:13,996 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 22:05:14,300 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-01 22:05:14,458 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 22:05:14,486 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:14,492 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:14,495 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-01 22:05:14,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:14,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:14,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:14,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:14,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:14,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:14,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:14,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:14,505 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-01 22:05:14,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:14,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:14,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:14,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:14,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:14,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:14,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:14,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:14,509 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-01 22:05:14,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:14,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:14,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:14,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:14,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:14,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:14,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:14,522 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-01 22:05:14,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:14,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:14,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:14,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:14,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:14,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:14,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:14,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:14,528 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-01 22:05:14,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:14,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:14,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:14,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:14,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:14,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:14,654 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:14,704 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:05:14,708 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:05:14,710 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:14,713 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:14,713 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:14,714 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 [] [2019-01-01 22:05:14,782 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:05:14,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:05:14,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:14,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:14,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:14,995 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-01 22:05:15,011 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-01 22:05:15,013 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-01-01 22:05:15,078 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-01 22:05:15,079 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-01 22:05:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:05:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-01-01 22:05:15,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 22:05:15,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:15,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 22:05:15,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:15,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 22:05:15,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:15,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-01-01 22:05:15,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 22:05:15,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 10 states and 13 transitions. [2019-01-01 22:05:15,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 22:05:15,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 22:05:15,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-01 22:05:15,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:15,098 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 22:05:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-01 22:05:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-01 22:05:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 22:05:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 22:05:15,130 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 22:05:15,130 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 22:05:15,130 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:05:15,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-01 22:05:15,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 22:05:15,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:15,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:15,132 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:15,132 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:05:15,132 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_~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-01 22:05:15,133 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_~j~0, 4);main_~j~0 := main_~j~0 + main_#t~mem209;havoc main_#t~mem209; 103#L374-2 [2019-01-01 22:05:15,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:15,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2019-01-01 22:05:15,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:15,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:15,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:15,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:15,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:15,206 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-01 22:05:15,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:05:15,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:05:15,210 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:05:15,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:15,211 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2019-01-01 22:05:15,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:15,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:15,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:15,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:15,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:15,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:05:15,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:05:15,283 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 22:05:15,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:15,318 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-01 22:05:15,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:05:15,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-01 22:05:15,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 22:05:15,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-01-01 22:05:15,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 22:05:15,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 22:05:15,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-01-01 22:05:15,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:15,323 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-01 22:05:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-01-01 22:05:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-01 22:05:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 22:05:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-01-01 22:05:15,325 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-01 22:05:15,325 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-01 22:05:15,325 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:05:15,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-01-01 22:05:15,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 22:05:15,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:15,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:15,328 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:15,328 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:05:15,328 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_~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-01 22:05:15,328 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_~j~0, 4);main_~j~0 := main_~j~0 + main_#t~mem209;havoc main_#t~mem209; 131#L374-2 [2019-01-01 22:05:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:15,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2019-01-01 22:05:15,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:15,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:15,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:15,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:15,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:15,366 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2019-01-01 22:05:15,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:15,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:15,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:15,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:15,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:15,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:15,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2019-01-01 22:05:15,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:15,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:15,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:15,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:15,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:15,867 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-01-01 22:05:15,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:05:15 BoogieIcfgContainer [2019-01-01 22:05:15,968 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:05:15,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:05:15,969 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:05:15,969 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:05:15,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:12" (3/4) ... [2019-01-01 22:05:15,974 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 22:05:16,047 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 22:05:16,051 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:05:16,053 INFO L168 Benchmark]: Toolchain (without parser) took 5201.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 951.3 MB in the beginning and 906.7 MB in the end (delta: 44.7 MB). Peak memory consumption was 140.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:16,058 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:16,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:16,060 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:16,060 INFO L168 Benchmark]: Boogie Preprocessor took 24.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:16,061 INFO L168 Benchmark]: RCFGBuilder took 562.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:16,062 INFO L168 Benchmark]: BuchiAutomizer took 3780.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 906.7 MB in the end (delta: 157.0 MB). Peak memory consumption was 157.0 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:16,063 INFO L168 Benchmark]: Witness Printer took 82.29 ms. Allocated memory is still 1.1 GB. Free memory is still 906.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:16,070 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 688.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 562.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3780.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 906.7 MB in the end (delta: 157.0 MB). Peak memory consumption was 157.0 MB. Max. memory is 11.5 GB. * Witness Printer took 82.29 ms. Allocated memory is still 1.1 GB. Free memory is still 906.7 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -4 * i + -1 * arr + unknown-#length-unknown[arr] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 20 SDtfs, 24 SDslu, 12 SDs, 0 SdLazy, 22 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital101 mio100 ax100 hnf99 lsp93 ukn82 mio100 lsp64 div100 bol100 ite100 ukn100 eq167 hnf91 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 374]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, \result=0, NULL=0, arr=-1, arr=0, i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52365349=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4418e3ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d654b85=0, length=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@4d045fd1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d654b85=-1, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5970059d=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 374]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i