./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array14_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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 ../sv-benchmarks/c/termination-15/array14_alloca.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 519b4f74907cdda12f126cdccb2c6422dda5240e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-9a8b2e8 [2020-10-20 06:42:07,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:42:07,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:42:07,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:42:07,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:42:07,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:42:07,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:42:07,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:42:07,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:42:07,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:42:07,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:42:07,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:42:07,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:42:07,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:42:07,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:42:07,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:42:07,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:42:07,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:42:07,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:42:07,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:42:07,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:42:07,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:42:07,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:42:07,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:42:07,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:42:07,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:42:07,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:42:07,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:42:07,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:42:07,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:42:07,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:42:07,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:42:07,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:42:07,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:42:07,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:42:07,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:42:07,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:42:07,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:42:07,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:42:07,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:42:07,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:42:07,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:42:07,127 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:42:07,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:42:07,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:42:07,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:42:07,130 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:42:07,130 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:42:07,130 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:42:07,130 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:42:07,131 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:42:07,131 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:42:07,131 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:42:07,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:42:07,132 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:42:07,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:42:07,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:42:07,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:42:07,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:42:07,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:42:07,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:42:07,133 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:42:07,133 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:42:07,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:42:07,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:42:07,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:42:07,134 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:42:07,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:42:07,135 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:42:07,135 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:42:07,135 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:42:07,136 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:42:07,137 INFO L138 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 -> 519b4f74907cdda12f126cdccb2c6422dda5240e [2020-10-20 06:42:07,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:42:07,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:42:07,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:42:07,409 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:42:07,410 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:42:07,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array14_alloca.i [2020-10-20 06:42:07,478 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f766031e1/9c83baf56a9548c2ac90bfc2d7f99bce/FLAGfddbce264 [2020-10-20 06:42:08,028 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:42:08,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array14_alloca.i [2020-10-20 06:42:08,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f766031e1/9c83baf56a9548c2ac90bfc2d7f99bce/FLAGfddbce264 [2020-10-20 06:42:08,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f766031e1/9c83baf56a9548c2ac90bfc2d7f99bce [2020-10-20 06:42:08,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:42:08,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:42:08,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:42:08,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:42:08,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:42:08,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:42:08" (1/1) ... [2020-10-20 06:42:08,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2195f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:08, skipping insertion in model container [2020-10-20 06:42:08,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:42:08" (1/1) ... [2020-10-20 06:42:08,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:42:08,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:42:08,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:42:08,812 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:42:08,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:42:08,930 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:42:08,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:08 WrapperNode [2020-10-20 06:42:08,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:42:08,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:42:08,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:42:08,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:42:08,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:08" (1/1) ... [2020-10-20 06:42:08,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:08" (1/1) ... [2020-10-20 06:42:08,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:42:08,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:42:08,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:42:08,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:42:08,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:08" (1/1) ... [2020-10-20 06:42:08,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:08" (1/1) ... [2020-10-20 06:42:08,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:08" (1/1) ... [2020-10-20 06:42:08,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:08" (1/1) ... [2020-10-20 06:42:08,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:08" (1/1) ... [2020-10-20 06:42:08,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:08" (1/1) ... [2020-10-20 06:42:08,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:08" (1/1) ... [2020-10-20 06:42:08,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:42:09,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:42:09,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:42:09,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:42:09,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:08" (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 [2020-10-20 06:42:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:42:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:42:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:42:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:42:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:42:09,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:42:09,363 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:42:09,363 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-20 06:42:09,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:42:09 BoogieIcfgContainer [2020-10-20 06:42:09,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:42:09,366 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:42:09,366 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:42:09,379 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:42:09,380 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:42:09,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:42:08" (1/3) ... [2020-10-20 06:42:09,381 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68dac20b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:42:09, skipping insertion in model container [2020-10-20 06:42:09,381 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:42:09,382 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:42:08" (2/3) ... [2020-10-20 06:42:09,382 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68dac20b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:42:09, skipping insertion in model container [2020-10-20 06:42:09,382 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:42:09,382 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:42:09" (3/3) ... [2020-10-20 06:42:09,384 INFO L373 chiAutomizerObserver]: Analyzing ICFG array14_alloca.i [2020-10-20 06:42:09,426 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:42:09,426 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:42:09,426 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:42:09,427 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:42:09,427 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:42:09,427 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:42:09,427 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:42:09,427 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:42:09,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-10-20 06:42:09,459 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 06:42:09,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:09,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:09,465 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:42:09,465 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:42:09,465 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:42:09,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-10-20 06:42:09,467 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 06:42:09,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:09,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:09,467 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:42:09,467 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:42:09,473 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#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_#t~post211, main_#t~post212, 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; 16#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; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2020-10-20 06:42:09,474 INFO L796 eck$LassoCheckResult]: Loop: 17#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); 9#L372true assume main_#t~mem209 > 0;havoc main_#t~mem209;call write~int(0, 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; 17#L370-3true [2020-10-20 06:42:09,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:09,479 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-10-20 06:42:09,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:09,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018966617] [2020-10-20 06:42:09,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:09,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:09,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:09,610 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:09,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:09,611 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2020-10-20 06:42:09,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:09,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959986118] [2020-10-20 06:42:09,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:09,624 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:09,634 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:09,638 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:09,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:09,639 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2020-10-20 06:42:09,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:09,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221013959] [2020-10-20 06:42:09,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:09,678 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:09,695 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:09,701 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:09,913 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2020-10-20 06:42:09,981 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:42:09,982 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:42:09,982 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:42:09,982 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:42:09,983 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:42:09,983 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:09,983 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:42:09,984 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:42:09,984 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration1_Lasso [2020-10-20 06:42:09,984 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:42:09,984 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:42:10,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:10,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:10,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:10,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:10,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:10,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:10,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:10,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:10,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:10,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:10,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:10,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:10,506 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:42:10,513 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:10,520 INFO L120 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 [2020-10-20 06:42:10,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:10,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:10,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:10,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:10,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:10,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:10,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:10,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:10,579 INFO L120 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 [2020-10-20 06:42:10,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:10,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:10,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:10,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:10,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:10,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:10,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:10,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:10,637 INFO L120 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 [2020-10-20 06:42:10,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:10,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:10,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:10,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:10,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:10,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:10,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:10,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:10,692 INFO L120 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 [2020-10-20 06:42:10,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:10,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:10,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:10,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:10,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:10,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:10,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:10,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:10,735 INFO L120 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 [2020-10-20 06:42:10,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:10,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:10,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:10,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:10,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:10,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:10,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:10,783 INFO L120 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 [2020-10-20 06:42:10,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:10,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:10,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:10,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:10,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:10,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:10,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:10,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:10,835 INFO L120 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 [2020-10-20 06:42:10,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:10,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:10,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:10,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:10,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:10,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:10,868 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:42:10,898 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-20 06:42:10,898 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:10,904 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:42:10,913 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:42:10,914 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:42:10,915 INFO L512 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 [] [2020-10-20 06:42:10,965 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-10-20 06:42:10,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:11,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:42:11,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:11,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:42:11,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:11,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:11,064 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 [2020-10-20 06:42:11,067 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2020-10-20 06:42:11,131 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2020-10-20 06:42:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:42:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:42:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-10-20 06:42:11,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-20 06:42:11,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:11,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2020-10-20 06:42:11,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:11,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2020-10-20 06:42:11,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:11,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2020-10-20 06:42:11,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:11,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2020-10-20 06:42:11,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-20 06:42:11,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-20 06:42:11,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2020-10-20 06:42:11,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:42:11,154 INFO L691 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-10-20 06:42:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2020-10-20 06:42:11,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-10-20 06:42:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-20 06:42:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2020-10-20 06:42:11,187 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-10-20 06:42:11,187 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-10-20 06:42:11,187 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:42:11,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2020-10-20 06:42:11,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:11,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:11,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:11,189 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:11,189 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:11,190 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 113#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_#t~post211, main_#t~post212, 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; 114#L367 assume !(main_~length~0 < 1); 121#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; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2020-10-20 06:42:11,190 INFO L796 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= 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); 120#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 118#L378-2 [2020-10-20 06:42:11,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2020-10-20 06:42:11,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:11,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497434441] [2020-10-20 06:42:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:11,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497434441] [2020-10-20 06:42:11,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:42:11,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 06:42:11,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061468225] [2020-10-20 06:42:11,253 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:42:11,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:11,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2020-10-20 06:42:11,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:11,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350078548] [2020-10-20 06:42:11,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:11,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:11,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:11,321 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:11,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:42:11,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:42:11,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:42:11,371 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-10-20 06:42:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:42:11,406 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-10-20 06:42:11,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:42:11,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2020-10-20 06:42:11,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:11,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2020-10-20 06:42:11,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 06:42:11,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-20 06:42:11,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-10-20 06:42:11,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:42:11,411 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-20 06:42:11,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-10-20 06:42:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2020-10-20 06:42:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-20 06:42:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-10-20 06:42:11,414 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-10-20 06:42:11,414 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-10-20 06:42:11,414 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:42:11,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-10-20 06:42:11,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:11,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:11,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:11,416 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:11,416 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:11,417 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 146#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_#t~post211, main_#t~post212, 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; 147#L367 assume !(main_~length~0 < 1); 154#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; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#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); 148#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2020-10-20 06:42:11,417 INFO L796 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= 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); 153#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 151#L378-2 [2020-10-20 06:42:11,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:11,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2020-10-20 06:42:11,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:11,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127916351] [2020-10-20 06:42:11,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:11,435 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:11,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:11,450 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:11,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:11,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2020-10-20 06:42:11,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:11,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012672614] [2020-10-20 06:42:11,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:11,457 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:11,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:11,462 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:11,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:11,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2020-10-20 06:42:11,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:11,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033738905] [2020-10-20 06:42:11,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:11,477 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:11,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:11,497 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:11,725 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2020-10-20 06:42:11,797 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:42:11,797 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:42:11,797 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:42:11,797 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:42:11,797 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:42:11,797 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:11,798 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:42:11,798 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:42:11,798 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration3_Lasso [2020-10-20 06:42:11,798 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:42:11,798 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:42:11,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:11,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:11,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:11,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:11,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:11,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:11,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:11,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:11,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:11,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:11,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:12,226 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:42:12,226 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:12,238 INFO L120 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 [2020-10-20 06:42:12,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:12,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:12,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:12,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:12,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:12,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:12,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:12,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:12,301 INFO L120 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 [2020-10-20 06:42:12,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:12,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:12,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:12,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:12,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:12,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:12,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:12,368 INFO L120 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 [2020-10-20 06:42:12,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:12,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:12,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:12,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:12,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:12,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:12,409 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:42:12,430 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-20 06:42:12,430 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:12,441 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:12,445 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:42:12,445 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:42:12,446 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2020-10-20 06:42:12,491 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-10-20 06:42:12,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:12,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:42:12,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:12,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:42:12,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:12,536 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 [2020-10-20 06:42:12,536 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-10-20 06:42:12,550 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2020-10-20 06:42:12,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:42:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:42:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2020-10-20 06:42:12,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2020-10-20 06:42:12,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:12,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2020-10-20 06:42:12,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:12,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2020-10-20 06:42:12,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:12,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2020-10-20 06:42:12,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:12,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2020-10-20 06:42:12,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 06:42:12,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:42:12,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-10-20 06:42:12,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:42:12,556 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-20 06:42:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-10-20 06:42:12,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-10-20 06:42:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-20 06:42:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-10-20 06:42:12,558 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-20 06:42:12,559 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-20 06:42:12,559 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:42:12,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-10-20 06:42:12,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:12,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:12,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:12,561 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:12,561 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:12,561 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 245#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_#t~post211, main_#t~post212, 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; 246#L367 assume !(main_~length~0 < 1); 255#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; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#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); 243#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 244#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 258#L370-3 assume !(main_~i~0 < main_~length~0); 247#L370-4 main_~j~0 := 0; 248#L378-2 assume !!(0 <= 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); 254#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 250#L378-2 [2020-10-20 06:42:12,562 INFO L796 eck$LassoCheckResult]: Loop: 250#L378-2 assume !!(0 <= 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); 251#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 250#L378-2 [2020-10-20 06:42:12,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:12,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2020-10-20 06:42:12,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:12,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530155384] [2020-10-20 06:42:12,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:12,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:12,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:12,595 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:12,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:12,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2020-10-20 06:42:12,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:12,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744690798] [2020-10-20 06:42:12,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:12,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:12,605 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:12,607 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:12,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:12,608 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2020-10-20 06:42:12,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:12,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489657150] [2020-10-20 06:42:12,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:12,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489657150] [2020-10-20 06:42:12,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135331694] [2020-10-20 06:42:12,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:42:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:12,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:42:12,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:12,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:42:12,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-10-20 06:42:12,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726223080] [2020-10-20 06:42:12,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:42:12,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:42:12,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:42:12,871 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 10 states. [2020-10-20 06:42:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:42:13,024 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-10-20 06:42:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:42:13,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions. [2020-10-20 06:42:13,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:13,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 28 transitions. [2020-10-20 06:42:13,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:42:13,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:42:13,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2020-10-20 06:42:13,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:42:13,028 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-10-20 06:42:13,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2020-10-20 06:42:13,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-10-20 06:42:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-20 06:42:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-10-20 06:42:13,031 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-20 06:42:13,031 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-20 06:42:13,032 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:42:13,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-10-20 06:42:13,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:13,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:13,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:13,034 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:13,034 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:13,034 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 360#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_#t~post211, main_#t~post212, 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; 361#L367 assume !(main_~length~0 < 1); 370#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; 371#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 372#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); 375#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 373#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 374#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); 358#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 359#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 376#L370-3 assume !(main_~i~0 < main_~length~0); 362#L370-4 main_~j~0 := 0; 363#L378-2 assume !!(0 <= 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); 369#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 365#L378-2 [2020-10-20 06:42:13,034 INFO L796 eck$LassoCheckResult]: Loop: 365#L378-2 assume !!(0 <= 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); 366#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 365#L378-2 [2020-10-20 06:42:13,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:13,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2020-10-20 06:42:13,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:13,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554189394] [2020-10-20 06:42:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:13,053 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:13,065 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:13,069 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:13,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:13,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2020-10-20 06:42:13,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:13,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788326477] [2020-10-20 06:42:13,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:13,075 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:13,078 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:13,079 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:13,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:13,080 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2020-10-20 06:42:13,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:13,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422567700] [2020-10-20 06:42:13,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:13,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:13,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:13,116 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:13,404 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2020-10-20 06:42:13,503 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:42:13,503 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:42:13,503 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:42:13,503 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:42:13,504 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:42:13,504 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:13,504 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:42:13,504 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:42:13,504 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration5_Lasso [2020-10-20 06:42:13,504 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:42:13,504 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:42:13,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:13,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:13,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:13,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:13,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:13,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:13,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:13,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:13,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:13,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:13,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:42:13,990 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:42:13,991 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:13,996 INFO L120 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 [2020-10-20 06:42:13,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:13,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:13,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:13,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:13,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:13,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:13,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:14,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:14,027 INFO L120 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 [2020-10-20 06:42:14,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:14,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:14,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:14,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:14,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:14,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:14,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:14,087 INFO L120 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 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:14,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:14,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:14,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:14,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:14,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:14,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:14,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:14,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:14,140 INFO L120 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 [2020-10-20 06:42:14,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:14,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:14,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:14,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:14,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:14,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:14,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:14,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:14,208 INFO L120 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 [2020-10-20 06:42:14,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:14,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:14,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:14,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:14,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:14,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:14,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:14,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:14,251 INFO L120 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 [2020-10-20 06:42:14,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:14,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:42:14,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:14,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:14,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:14,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:42:14,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:42:14,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:14,310 INFO L120 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 [2020-10-20 06:42:14,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:14,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:14,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:14,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:14,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:14,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:14,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:14,341 INFO L120 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 [2020-10-20 06:42:14,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:14,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:14,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:14,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:14,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:14,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:42:14,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:14,390 INFO L120 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 [2020-10-20 06:42:14,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:14,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:14,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:14,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:14,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:14,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:14,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:42:14,443 INFO L120 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 [2020-10-20 06:42:14,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:42:14,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:42:14,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:42:14,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:42:14,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:42:14,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:14,466 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:42:14,497 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2020-10-20 06:42:14,497 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:42:14,500 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:42:14,502 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:42:14,503 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:42:14,503 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = 2*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-10-20 06:42:14,535 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-20 06:42:14,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:14,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:42:14,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:14,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:42:14,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:14,585 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 [2020-10-20 06:42:14,585 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-20 06:42:14,598 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 31 transitions. Complement of second has 5 states. [2020-10-20 06:42:14,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:42:14,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:42:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-10-20 06:42:14,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2020-10-20 06:42:14,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:14,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2020-10-20 06:42:14,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:14,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2020-10-20 06:42:14,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:42:14,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2020-10-20 06:42:14,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:14,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2020-10-20 06:42:14,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-20 06:42:14,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 06:42:14,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2020-10-20 06:42:14,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:42:14,603 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-10-20 06:42:14,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2020-10-20 06:42:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-10-20 06:42:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-20 06:42:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2020-10-20 06:42:14,606 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-10-20 06:42:14,606 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-10-20 06:42:14,607 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:42:14,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2020-10-20 06:42:14,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:42:14,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:14,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:14,608 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:14,609 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:42:14,609 INFO L794 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 488#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_#t~post211, main_#t~post212, 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; 489#L367 assume !(main_~length~0 < 1); 500#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; 501#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 502#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); 506#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 503#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 504#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); 490#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 491#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 507#L370-3 assume !(main_~i~0 < main_~length~0); 492#L370-4 main_~j~0 := 0; 493#L378-2 assume !!(0 <= 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); 499#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 505#L378-2 assume !!(0 <= 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); 508#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 495#L378-2 [2020-10-20 06:42:14,609 INFO L796 eck$LassoCheckResult]: Loop: 495#L378-2 assume !!(0 <= 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); 496#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 495#L378-2 [2020-10-20 06:42:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:14,610 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2020-10-20 06:42:14,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:14,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969757938] [2020-10-20 06:42:14,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:14,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:14,652 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:14,656 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:14,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:14,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2020-10-20 06:42:14,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:14,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115726765] [2020-10-20 06:42:14,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:14,661 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:14,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:14,666 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:14,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:14,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2020-10-20 06:42:14,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:14,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289416108] [2020-10-20 06:42:14,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:42:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:14,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289416108] [2020-10-20 06:42:14,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720189524] [2020-10-20 06:42:14,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:42:14,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-20 06:42:14,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:42:14,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:42:14,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:42:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:42:14,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:42:14,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-10-20 06:42:14,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18710441] [2020-10-20 06:42:14,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:42:14,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 06:42:14,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:42:14,924 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 13 states. [2020-10-20 06:42:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:42:15,094 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2020-10-20 06:42:15,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:42:15,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 65 transitions. [2020-10-20 06:42:15,097 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 06:42:15,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 46 states and 62 transitions. [2020-10-20 06:42:15,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-20 06:42:15,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-20 06:42:15,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 62 transitions. [2020-10-20 06:42:15,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:42:15,100 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2020-10-20 06:42:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 62 transitions. [2020-10-20 06:42:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-10-20 06:42:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-20 06:42:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-10-20 06:42:15,104 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-10-20 06:42:15,104 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-10-20 06:42:15,105 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:42:15,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2020-10-20 06:42:15,106 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 06:42:15,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:42:15,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:42:15,107 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:42:15,107 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-10-20 06:42:15,108 INFO L794 eck$LassoCheckResult]: Stem: 647#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 641#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_#t~post211, main_#t~post212, 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; 642#L367 assume !(main_~length~0 < 1); 653#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; 654#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 655#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); 660#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 664#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 661#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); 662#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 679#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 663#L370-3 assume !(main_~i~0 < main_~length~0); 645#L370-4 main_~j~0 := 0; 646#L378-2 assume !!(0 <= 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); 652#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 657#L378-2 assume !!(0 <= 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); 658#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 659#L378-2 assume !!(0 <= 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); 669#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 668#L378-2 [2020-10-20 06:42:15,108 INFO L796 eck$LassoCheckResult]: Loop: 668#L378-2 assume !!(0 <= 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); 665#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 666#L378-2 assume !!(0 <= 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); 670#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 668#L378-2 [2020-10-20 06:42:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:15,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2020-10-20 06:42:15,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:15,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725741866] [2020-10-20 06:42:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:15,122 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:15,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:15,139 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:15,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:15,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2020-10-20 06:42:15,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:15,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219068395] [2020-10-20 06:42:15,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:15,148 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:15,152 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:15,154 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:15,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:42:15,155 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2020-10-20 06:42:15,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:42:15,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59444686] [2020-10-20 06:42:15,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:42:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:15,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:42:15,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:42:15,200 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:42:15,673 WARN L193 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 101 [2020-10-20 06:42:15,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:42:15 BoogieIcfgContainer [2020-10-20 06:42:15,776 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:42:15,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:42:15,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:42:15,777 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:42:15,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:42:09" (3/4) ... [2020-10-20 06:42:15,782 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:42:15,836 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:42:15,837 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:42:15,838 INFO L168 Benchmark]: Toolchain (without parser) took 7514.40 ms. Allocated memory was 35.7 MB in the beginning and 86.0 MB in the end (delta: 50.3 MB). Free memory was 8.9 MB in the beginning and 38.6 MB in the end (delta: -29.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:15,839 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 35.7 MB. Free memory is still 14.9 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 06:42:15,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 600.34 ms. Allocated memory was 35.7 MB in the beginning and 46.7 MB in the end (delta: 11.0 MB). Free memory was 8.0 MB in the beginning and 27.4 MB in the end (delta: -19.4 MB). Peak memory consumption was 8.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:15,841 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.54 ms. Allocated memory is still 46.7 MB. Free memory was 27.2 MB in the beginning and 25.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:15,841 INFO L168 Benchmark]: Boogie Preprocessor took 24.32 ms. Allocated memory is still 46.7 MB. Free memory was 25.2 MB in the beginning and 23.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:15,842 INFO L168 Benchmark]: RCFGBuilder took 365.53 ms. Allocated memory was 46.7 MB in the beginning and 47.2 MB in the end (delta: 524.3 kB). Free memory was 23.7 MB in the beginning and 26.7 MB in the end (delta: -3.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:15,843 INFO L168 Benchmark]: BuchiAutomizer took 6410.08 ms. Allocated memory was 47.2 MB in the beginning and 86.0 MB in the end (delta: 38.8 MB). Free memory was 26.4 MB in the beginning and 40.8 MB in the end (delta: -14.4 MB). Peak memory consumption was 58.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:15,843 INFO L168 Benchmark]: Witness Printer took 60.46 ms. Allocated memory is still 86.0 MB. Free memory was 40.8 MB in the beginning and 38.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:42:15,847 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 35.7 MB. Free memory is still 14.9 MB. There was no memory consumed. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 600.34 ms. Allocated memory was 35.7 MB in the beginning and 46.7 MB in the end (delta: 11.0 MB). Free memory was 8.0 MB in the beginning and 27.4 MB in the end (delta: -19.4 MB). Peak memory consumption was 8.9 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 43.54 ms. Allocated memory is still 46.7 MB. Free memory was 27.2 MB in the beginning and 25.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 24.32 ms. Allocated memory is still 46.7 MB. Free memory was 25.2 MB in the beginning and 23.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. * RCFGBuilder took 365.53 ms. Allocated memory was 46.7 MB in the beginning and 47.2 MB in the end (delta: 524.3 kB). Free memory was 23.7 MB in the beginning and 26.7 MB in the end (delta: -3.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 6410.08 ms. Allocated memory was 47.2 MB in the beginning and 86.0 MB in the end (delta: 38.8 MB). Free memory was 26.4 MB in the beginning and 40.8 MB in the end (delta: -14.4 MB). Peak memory consumption was 58.7 MB. Max. memory is 14.3 GB. * Witness Printer took 60.46 ms. Allocated memory is still 86.0 MB. Free memory was 40.8 MB in the beginning and 38.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * j + length and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 5.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 65 SDtfs, 107 SDslu, 83 SDs, 0 SdLazy, 210 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital134 mio100 ax100 hnf97 lsp94 ukn80 mio100 lsp62 div100 bol100 ite100 ukn100 eq162 hnf89 smp88 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms 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=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2203e64d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7dc13fed=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f09331=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@58567246=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f09331=2, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@6dbd98be=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@62f8c33b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5ce9290d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@540b2e7b=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 0) [L370] i++ [L370] COND TRUE i 0) [L370] i++ [L370] COND FALSE !(i