./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/array20_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/array20_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 15cc26ae0dc42c909592f114b7003fa240a2d07d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:27,223 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:05:27,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:05:27,241 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:05:27,241 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:05:27,242 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:05:27,244 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:05:27,246 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:05:27,247 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:05:27,248 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:05:27,249 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:05:27,249 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:05:27,250 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:05:27,251 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:05:27,252 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:05:27,253 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:05:27,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:05:27,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:05:27,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:05:27,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:05:27,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:05:27,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:05:27,265 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:05:27,265 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:05:27,265 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:05:27,266 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:05:27,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:05:27,268 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:05:27,269 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:05:27,270 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:05:27,271 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:05:27,271 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:05:27,272 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:05:27,272 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:05:27,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:05:27,273 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:05:27,274 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:27,295 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:05:27,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:05:27,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:05:27,298 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:05:27,298 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:05:27,298 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:05:27,298 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:05:27,298 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:05:27,298 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:05:27,303 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:05:27,303 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:05:27,303 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:05:27,304 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:05:27,304 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:05:27,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:05:27,305 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:05:27,305 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:05:27,305 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:05:27,305 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:05:27,305 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:05:27,305 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:05:27,306 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:05:27,306 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:05:27,306 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:05:27,306 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:05:27,306 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:05:27,306 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:05:27,310 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:05:27,312 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:05:27,313 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 -> 15cc26ae0dc42c909592f114b7003fa240a2d07d [2019-01-01 22:05:27,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:05:27,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:05:27,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:05:27,404 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:05:27,404 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:05:27,405 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/array20_alloca_false-termination.c.i [2019-01-01 22:05:27,464 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24f2c677/fcde360e96c94c98a1a38aedbd80e4a8/FLAGa8dca9163 [2019-01-01 22:05:27,979 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:05:27,980 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/array20_alloca_false-termination.c.i [2019-01-01 22:05:27,991 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24f2c677/fcde360e96c94c98a1a38aedbd80e4a8/FLAGa8dca9163 [2019-01-01 22:05:28,251 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24f2c677/fcde360e96c94c98a1a38aedbd80e4a8 [2019-01-01 22:05:28,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:05:28,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:05:28,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:05:28,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:05:28,261 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:05:28,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:05:28" (1/1) ... [2019-01-01 22:05:28,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fb2347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:28, skipping insertion in model container [2019-01-01 22:05:28,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:05:28" (1/1) ... [2019-01-01 22:05:28,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:05:28,320 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:05:28,770 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:05:28,789 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:05:28,839 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:05:28,915 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:05:28,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:28 WrapperNode [2019-01-01 22:05:28,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:05:28,916 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:05:28,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:05:28,917 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:05:29,004 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:28" (1/1) ... [2019-01-01 22:05:29,020 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:28" (1/1) ... [2019-01-01 22:05:29,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:05:29,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:05:29,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:05:29,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:05:29,055 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:28" (1/1) ... [2019-01-01 22:05:29,055 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:28" (1/1) ... [2019-01-01 22:05:29,058 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:28" (1/1) ... [2019-01-01 22:05:29,058 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:28" (1/1) ... [2019-01-01 22:05:29,065 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:28" (1/1) ... [2019-01-01 22:05:29,071 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:28" (1/1) ... [2019-01-01 22:05:29,072 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:28" (1/1) ... [2019-01-01 22:05:29,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:05:29,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:05:29,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:05:29,076 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:05:29,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:28" (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:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:05:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:05:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:05:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:05:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:05:29,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:05:29,467 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:05:29,467 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 22:05:29,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:29 BoogieIcfgContainer [2019-01-01 22:05:29,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:05:29,469 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:05:29,470 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:05:29,475 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:05:29,476 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:29,476 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:05:28" (1/3) ... [2019-01-01 22:05:29,478 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50118b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:05:29, skipping insertion in model container [2019-01-01 22:05:29,478 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:29,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:28" (2/3) ... [2019-01-01 22:05:29,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50118b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:05:29, skipping insertion in model container [2019-01-01 22:05:29,479 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:29,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:29" (3/3) ... [2019-01-01 22:05:29,482 INFO L375 chiAutomizerObserver]: Analyzing ICFG array20_alloca_false-termination.c.i [2019-01-01 22:05:29,592 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:05:29,593 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:05:29,593 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:05:29,594 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:05:29,594 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:05:29,594 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:05:29,594 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:05:29,594 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:05:29,595 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:05:29,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 22:05:29,635 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 22:05:29,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:29,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:29,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:05:29,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:29,644 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:05:29,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 22:05:29,646 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 22:05:29,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:29,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:29,647 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:05:29,647 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:29,656 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, 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; 15#L367true assume !(main_~length~0 < 1); 4#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; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 16#L370-3true [2019-01-01 22:05:29,657 INFO L796 eck$LassoCheckResult]: Loop: 16#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;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 8#L372true assume main_#t~mem209 < 1;havoc main_#t~mem209;call write~int(1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 16#L370-3true [2019-01-01 22:05:29,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:29,664 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-01 22:05:29,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:29,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:29,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:29,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:29,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:29,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:29,804 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-01-01 22:05:29,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:29,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:29,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:29,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:29,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:29,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:29,831 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-01-01 22:05:29,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:29,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:29,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:29,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:29,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:30,029 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 22:05:30,458 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-01-01 22:05:30,559 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:30,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:30,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:30,561 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:30,561 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:30,561 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:30,561 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:30,561 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:30,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: array20_alloca_false-termination.c.i_Iteration1_Lasso [2019-01-01 22:05:30,562 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:30,563 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:30,592 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:30,621 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:30,634 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:30,636 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:30,645 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:30,654 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:30,657 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:30,663 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:30,861 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-01 22:05:30,901 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:30,906 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:31,191 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 22:05:31,741 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:31,746 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:31,748 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:31,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:31,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:31,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:31,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:31,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:31,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:31,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:31,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:31,757 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:31,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:31,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:31,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:31,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:31,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:31,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:31,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:31,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:31,761 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:31,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:31,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:31,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:31,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:31,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:31,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:31,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:31,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:31,765 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:31,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:31,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:31,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:31,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:31,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:31,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:31,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:31,775 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:31,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:31,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:31,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:31,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:31,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:31,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:31,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:31,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:31,779 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:31,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:31,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:31,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:31,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:31,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:31,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:31,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:31,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:31,783 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:31,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:31,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:31,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:31,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:31,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:31,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:31,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:31,793 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:31,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:31,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:31,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:31,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:31,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:31,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:31,893 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:31,957 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 22:05:31,957 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 22:05:31,960 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:31,963 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:31,963 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:31,964 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-01-01 22:05:32,060 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:05:32,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:32,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:32,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:32,333 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:32,354 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:32,356 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-01-01 22:05:32,464 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 32 states and 44 transitions. Complement of second has 7 states. [2019-01-01 22:05:32,466 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:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:05:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2019-01-01 22:05:32,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 22:05:32,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:32,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 22:05:32,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:32,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-01 22:05:32,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:32,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 44 transitions. [2019-01-01 22:05:32,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 22:05:32,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 11 states and 15 transitions. [2019-01-01 22:05:32,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 22:05:32,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 22:05:32,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2019-01-01 22:05:32,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:32,486 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-01 22:05:32,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2019-01-01 22:05:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 22:05:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 22:05:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-01-01 22:05:32,513 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-01 22:05:32,513 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-01 22:05:32,513 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:05:32,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-01-01 22:05:32,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 22:05:32,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:32,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:32,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:32,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:05:32,516 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 109#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, 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; 110#L367 assume !(main_~length~0 < 1); 116#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; 117#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 118#L370-3 assume !(main_~i~0 < main_~length~0); 113#L370-4 main_~j~0 := 1; 114#L377-2 [2019-01-01 22:05:32,517 INFO L796 eck$LassoCheckResult]: Loop: 114#L377-2 assume !!(1 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_~j~0 := main_~j~0 * main_#t~mem210;havoc main_#t~mem210; 114#L377-2 [2019-01-01 22:05:32,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:32,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-01-01 22:05:32,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:32,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:32,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:32,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:32,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:32,610 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:32,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:05:32,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:05:32,614 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:05:32,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:32,615 INFO L82 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 1 times [2019-01-01 22:05:32,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:32,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:32,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:32,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:32,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:32,620 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:05:32,620 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:05:32,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-01 22:05:32,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:32,924 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 22:05:32,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:05:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:05:32,949 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 22:05:33,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:33,009 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2019-01-01 22:05:33,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:05:33,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2019-01-01 22:05:33,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 22:05:33,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 17 transitions. [2019-01-01 22:05:33,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 22:05:33,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 22:05:33,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-01 22:05:33,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:33,014 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 22:05:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-01 22:05:33,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-01-01 22:05:33,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 22:05:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-01 22:05:33,017 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 22:05:33,017 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 22:05:33,017 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:05:33,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-01-01 22:05:33,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 22:05:33,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:33,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:33,018 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:33,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:05:33,019 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, 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; 141#L367 assume !(main_~length~0 < 1); 147#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; 148#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 149#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;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 142#L372 assume !(main_#t~mem209 < 1);havoc main_#t~mem209; 143#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 150#L370-3 assume !(main_~i~0 < main_~length~0); 144#L370-4 main_~j~0 := 1; 145#L377-2 [2019-01-01 22:05:33,019 INFO L796 eck$LassoCheckResult]: Loop: 145#L377-2 assume !!(1 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_~j~0 := main_~j~0 * main_#t~mem210;havoc main_#t~mem210; 145#L377-2 [2019-01-01 22:05:33,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:33,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-01-01 22:05:33,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:33,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:33,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:33,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:33,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:33,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:33,043 INFO L82 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 2 times [2019-01-01 22:05:33,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:33,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:33,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:33,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:33,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:33,048 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:05:33,048 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:05:33,048 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-01 22:05:33,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:05:33,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 22:05:33,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-01 22:05:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:33,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1329989554, now seen corresponding path program 1 times [2019-01-01 22:05:33,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:33,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:33,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:33,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:33,115 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:05:33,115 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:05:33,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-01 22:05:33,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:33,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:33,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:05:33,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-01-01 22:05:33,501 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 22:05:33,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:05:33,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:05:33,503 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-01-01 22:05:33,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:33,939 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-01-01 22:05:33,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 22:05:33,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2019-01-01 22:05:33,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 22:05:33,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 16 states and 20 transitions. [2019-01-01 22:05:33,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 22:05:33,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 22:05:33,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-01-01 22:05:33,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:33,944 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 22:05:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-01-01 22:05:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-01-01 22:05:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 22:05:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-01-01 22:05:33,947 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-01 22:05:33,947 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-01 22:05:33,947 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:05:33,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-01-01 22:05:33,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 22:05:33,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:33,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:33,949 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:33,949 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:05:33,949 INFO L794 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, 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; 223#L367 assume !(main_~length~0 < 1); 229#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; 230#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 231#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;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 233#L372 assume !(main_#t~mem209 < 1);havoc main_#t~mem209; 235#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 234#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;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 224#L372 assume !(main_#t~mem209 < 1);havoc main_#t~mem209; 225#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 232#L370-3 assume !(main_~i~0 < main_~length~0); 226#L370-4 main_~j~0 := 1; 227#L377-2 [2019-01-01 22:05:33,949 INFO L796 eck$LassoCheckResult]: Loop: 227#L377-2 assume !!(1 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_~j~0 := main_~j~0 * main_#t~mem210;havoc main_#t~mem210; 227#L377-2 [2019-01-01 22:05:33,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:33,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1781949270, now seen corresponding path program 2 times [2019-01-01 22:05:33,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:33,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:33,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:33,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:33,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:33,978 INFO L82 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 3 times [2019-01-01 22:05:33,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:33,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:33,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:33,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:33,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:33,981 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:05:33,981 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:05:33,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-01 22:05:33,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 22:05:33,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-01-01 22:05:33,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-01 22:05:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:34,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:34,022 INFO L82 PathProgramCache]: Analyzing trace with hash -594147436, now seen corresponding path program 2 times [2019-01-01 22:05:34,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:34,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:34,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:34,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:34,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:34,031 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:05:34,032 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:05:34,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-01 22:05:34,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:05:34,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:05:34,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-01 22:05:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:34,854 WARN L181 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-01-01 22:05:34,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:05:34 BoogieIcfgContainer [2019-01-01 22:05:34,961 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:05:34,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:05:34,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:05:34,962 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:05:34,963 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:29" (3/4) ... [2019-01-01 22:05:34,967 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 22:05:35,021 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 22:05:35,021 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:05:35,023 INFO L168 Benchmark]: Toolchain (without parser) took 6768.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 952.7 MB in the beginning and 841.7 MB in the end (delta: 111.0 MB). Peak memory consumption was 230.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:35,025 INFO L168 Benchmark]: CDTParser took 0.16 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:35,025 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.07 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:35,026 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:35,028 INFO L168 Benchmark]: Boogie Preprocessor took 30.78 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:35,029 INFO L168 Benchmark]: RCFGBuilder took 393.20 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:35,030 INFO L168 Benchmark]: BuchiAutomizer took 5491.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 841.7 MB in the end (delta: 246.7 MB). Peak memory consumption was 246.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:35,031 INFO L168 Benchmark]: Witness Printer took 60.24 ms. Allocated memory is still 1.1 GB. Free memory is still 841.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:35,036 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 659.07 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 127.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.78 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 393.20 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5491.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 841.7 MB in the end (delta: 246.7 MB). Peak memory consumption was 246.7 MB. Max. memory is 11.5 GB. * Witness Printer took 60.24 ms. Allocated memory is still 1.1 GB. Free memory is still 841.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 4.3s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 56 SDslu, 26 SDs, 0 SdLazy, 58 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital104 mio100 ax100 hnf99 lsp91 ukn82 mio100 lsp64 div100 bol100 ite100 ukn100 eq167 hnf91 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms 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: 377]: 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=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6128cd9e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25a135dd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@658907e8=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@56197b65=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@658907e8=-1, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@2b31626d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1a35dd6e=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: 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