./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-2.c --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-crafted/NonTermination3-2.c -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 b10c0555613e3e1e99ee574b69e31152fe0aa7f9 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:33:11,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:33:11,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:33:11,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:33:11,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:33:11,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:33:11,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:33:11,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:33:11,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:33:11,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:33:11,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:33:11,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:33:11,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:33:11,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:33:11,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:33:11,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:33:11,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:33:11,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:33:11,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:33:11,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:33:11,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:33:11,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:33:11,304 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:33:11,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:33:11,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:33:11,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:33:11,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:33:11,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:33:11,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:33:11,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:33:11,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:33:11,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:33:11,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:33:11,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:33:11,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:33:11,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:33:11,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:33:11,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:33:11,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:33:11,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:33:11,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:33:11,330 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:33:11,374 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:33:11,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:33:11,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:33:11,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:33:11,377 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:33:11,378 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:33:11,378 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:33:11,378 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:33:11,378 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:33:11,379 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:33:11,380 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:33:11,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:33:11,380 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:33:11,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:33:11,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:33:11,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:33:11,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:33:11,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:33:11,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:33:11,383 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:33:11,383 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:33:11,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:33:11,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:33:11,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:33:11,384 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:33:11,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:33:11,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:33:11,385 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:33:11,385 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:33:11,387 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:33:11,387 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 -> b10c0555613e3e1e99ee574b69e31152fe0aa7f9 [2020-10-20 06:33:11,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:33:11,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:33:11,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:33:11,623 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:33:11,624 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:33:11,625 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2020-10-20 06:33:11,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42549fc0c/a6f09fef1c214c99a32f86579ff56de8/FLAG26483d8e1 [2020-10-20 06:33:12,159 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:33:12,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2020-10-20 06:33:12,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42549fc0c/a6f09fef1c214c99a32f86579ff56de8/FLAG26483d8e1 [2020-10-20 06:33:12,530 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42549fc0c/a6f09fef1c214c99a32f86579ff56de8 [2020-10-20 06:33:12,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:33:12,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:33:12,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:33:12,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:33:12,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:33:12,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:33:12" (1/1) ... [2020-10-20 06:33:12,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f290439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:12, skipping insertion in model container [2020-10-20 06:33:12,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:33:12" (1/1) ... [2020-10-20 06:33:12,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:33:12,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:33:12,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:33:12,818 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:33:12,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:33:12,855 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:33:12,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:12 WrapperNode [2020-10-20 06:33:12,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:33:12,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:33:12,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:33:12,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:33:12,863 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:33:12" (1/1) ... [2020-10-20 06:33:12,869 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:33:12" (1/1) ... [2020-10-20 06:33:12,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:33:12,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:33:12,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:33:12,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:33:12,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:12" (1/1) ... [2020-10-20 06:33:12,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:12" (1/1) ... [2020-10-20 06:33:12,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:12" (1/1) ... [2020-10-20 06:33:12,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:12" (1/1) ... [2020-10-20 06:33:12,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:12" (1/1) ... [2020-10-20 06:33:12,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:12" (1/1) ... [2020-10-20 06:33:12,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:12" (1/1) ... [2020-10-20 06:33:12,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:33:12,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:33:12,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:33:12,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:33:12,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:12" (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:33:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:33:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:33:12,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:33:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:33:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:33:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:33:13,180 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:33:13,180 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-20 06:33:13,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:33:13 BoogieIcfgContainer [2020-10-20 06:33:13,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:33:13,185 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:33:13,185 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:33:13,191 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:33:13,192 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:33:13,193 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:33:12" (1/3) ... [2020-10-20 06:33:13,194 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3212f334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:33:13, skipping insertion in model container [2020-10-20 06:33:13,194 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:33:13,195 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:12" (2/3) ... [2020-10-20 06:33:13,196 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3212f334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:33:13, skipping insertion in model container [2020-10-20 06:33:13,196 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:33:13,196 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:33:13" (3/3) ... [2020-10-20 06:33:13,198 INFO L373 chiAutomizerObserver]: Analyzing ICFG NonTermination3-2.c [2020-10-20 06:33:13,260 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:33:13,261 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:33:13,261 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:33:13,261 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:33:13,261 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:33:13,262 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:33:13,262 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:33:13,262 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:33:13,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-10-20 06:33:13,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 06:33:13,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:13,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:13,326 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:33:13,326 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:33:13,327 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:33:13,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-10-20 06:33:13,328 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 06:33:13,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:13,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:13,329 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:33:13,329 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:33:13,338 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 5#L13-3true [2020-10-20 06:33:13,339 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-3true assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 8#L13-2true main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 5#L13-3true [2020-10-20 06:33:13,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:13,345 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:33:13,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:13,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21240739] [2020-10-20 06:33:13,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:13,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:13,452 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:13,483 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:13,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-20 06:33:13,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:13,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770883050] [2020-10-20 06:33:13,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:13,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:13,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:13,508 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-20 06:33:13,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:13,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827418390] [2020-10-20 06:33:13,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:13,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:13,546 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:13,551 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:13,796 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:33:13,797 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:33:13,797 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:33:13,797 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:33:13,798 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:33:13,798 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:13,798 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:33:13,798 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:33:13,799 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-2.c_Iteration1_Lasso [2020-10-20 06:33:13,799 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:33:13,800 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:33:13,824 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:33:13,834 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:33:13,838 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:33:13,842 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:33:13,845 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:33:13,850 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:33:13,854 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:33:13,911 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:33:13,915 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:33:13,918 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:33:14,098 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:33:14,103 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:33:14,112 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:33:14,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:14,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:33:14,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:14,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:14,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:14,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:33:14,118 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:33:14,122 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:33:14,166 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:33:14,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:14,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:33:14,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:14,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:14,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:14,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:33:14,170 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:33:14,172 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) [2020-10-20 06:33:14,216 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:33:14,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:14,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:33:14,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:14,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:14,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:14,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:33:14,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:14,222 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:33:14,260 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:33:14,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:14,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:33:14,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:14,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:14,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:14,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:33:14,264 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:33:14,271 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) [2020-10-20 06:33:14,309 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:33:14,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:14,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:14,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:14,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:14,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:33:14,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:14,326 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) [2020-10-20 06:33:14,361 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:33:14,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:14,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:33:14,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:14,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:14,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:14,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:33:14,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:14,368 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) [2020-10-20 06:33:14,404 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:33:14,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:14,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:14,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:14,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:14,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:33:14,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:14,419 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:33:14,461 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:14,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:14,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:14,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:14,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:14,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:33:14,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:33:14,472 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:33:14,508 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:14,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:14,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:14,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:14,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:14,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:33:14,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:33:14,520 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:14,553 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:33:14,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:14,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:33:14,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:14,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:14,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:14,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:33:14,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:33:14,558 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:14,597 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:33:14,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:14,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:33:14,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:14,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:14,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:14,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:33:14,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:33:14,602 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 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:14,635 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:33:14,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:14,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:14,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:14,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:14,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:33:14,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:33:14,678 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:33:14,712 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-20 06:33:14,712 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:14,725 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:33:14,728 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:33:14,729 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:33:14,729 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2020-10-20 06:33:14,761 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-10-20 06:33:14,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:14,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:33:14,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:14,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:33:14,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:14,843 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:33:14,860 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:33:14,862 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2020-10-20 06:33:14,918 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2020-10-20 06:33:14,920 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:33:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:33:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-10-20 06:33:14,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-20 06:33:14,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:33:14,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-20 06:33:14,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:33:14,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-20 06:33:14,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:33:14,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2020-10-20 06:33:14,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:14,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2020-10-20 06:33:14,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:14,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-20 06:33:14,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-10-20 06:33:14,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:14,945 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-20 06:33:14,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-10-20 06:33:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-10-20 06:33:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 06:33:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-10-20 06:33:14,977 INFO L714 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-10-20 06:33:14,977 INFO L594 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-10-20 06:33:14,978 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:33:14,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-10-20 06:33:14,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:14,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:14,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:14,980 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 06:33:14,980 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:14,981 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 84#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 85#L13-3 assume !(main_~n~0 < 10); 83#L17-4 [2020-10-20 06:33:14,981 INFO L796 eck$LassoCheckResult]: Loop: 83#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 89#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 82#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 83#L17-4 [2020-10-20 06:33:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:14,982 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2020-10-20 06:33:14,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:14,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433574580] [2020-10-20 06:33:14,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:15,058 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:33:15,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433574580] [2020-10-20 06:33:15,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:33:15,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:33:15,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488513764] [2020-10-20 06:33:15,063 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:15,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:15,063 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2020-10-20 06:33:15,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:15,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111732471] [2020-10-20 06:33:15,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:15,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:15,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:15,082 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:15,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:15,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:33:15,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:33:15,196 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-10-20 06:33:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:15,209 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-10-20 06:33:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:33:15,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2020-10-20 06:33:15,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:15,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2020-10-20 06:33:15,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:15,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:15,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-10-20 06:33:15,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:15,212 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-10-20 06:33:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-10-20 06:33:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-10-20 06:33:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 06:33:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-10-20 06:33:15,214 INFO L714 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-10-20 06:33:15,214 INFO L594 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-10-20 06:33:15,214 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:33:15,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-10-20 06:33:15,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:15,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:15,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:15,215 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:33:15,215 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:15,216 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 105#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 106#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 109#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 110#L13-3 assume !(main_~n~0 < 10); 108#L17-4 [2020-10-20 06:33:15,216 INFO L796 eck$LassoCheckResult]: Loop: 108#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 112#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 107#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 108#L17-4 [2020-10-20 06:33:15,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2020-10-20 06:33:15,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:15,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327230196] [2020-10-20 06:33:15,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:15,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327230196] [2020-10-20 06:33:15,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644892561] [2020-10-20 06:33:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:15,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 06:33:15,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:15,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:15,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2020-10-20 06:33:15,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968061019] [2020-10-20 06:33:15,311 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:15,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:15,311 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2020-10-20 06:33:15,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:15,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896528647] [2020-10-20 06:33:15,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:15,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:15,327 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:15,329 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:15,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:15,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:33:15,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:33:15,417 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-10-20 06:33:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:15,437 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-10-20 06:33:15,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:33:15,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2020-10-20 06:33:15,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:15,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2020-10-20 06:33:15,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:15,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:15,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2020-10-20 06:33:15,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:15,440 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-10-20 06:33:15,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2020-10-20 06:33:15,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-10-20 06:33:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-20 06:33:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2020-10-20 06:33:15,443 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-10-20 06:33:15,443 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-10-20 06:33:15,443 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:33:15,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-10-20 06:33:15,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:15,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:15,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:15,445 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-10-20 06:33:15,445 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:15,445 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 144#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 145#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 148#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 149#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 150#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 153#L13-3 assume !(main_~n~0 < 10); 147#L17-4 [2020-10-20 06:33:15,445 INFO L796 eck$LassoCheckResult]: Loop: 147#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 152#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 146#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 147#L17-4 [2020-10-20 06:33:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:15,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2020-10-20 06:33:15,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:15,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180654361] [2020-10-20 06:33:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:15,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180654361] [2020-10-20 06:33:15,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653387371] [2020-10-20 06:33:15,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:15,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:33:15,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:33:15,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:33:15,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:15,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:15,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-20 06:33:15,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623137184] [2020-10-20 06:33:15,563 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:15,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:15,564 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2020-10-20 06:33:15,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:15,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449618864] [2020-10-20 06:33:15,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:15,570 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:15,575 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:15,577 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:15,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:15,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 06:33:15,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 06:33:15,669 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2020-10-20 06:33:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:15,688 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-10-20 06:33:15,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:33:15,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2020-10-20 06:33:15,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:15,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2020-10-20 06:33:15,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:15,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:15,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2020-10-20 06:33:15,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:15,691 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-10-20 06:33:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2020-10-20 06:33:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-10-20 06:33:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-20 06:33:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2020-10-20 06:33:15,693 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-10-20 06:33:15,693 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-10-20 06:33:15,693 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:33:15,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2020-10-20 06:33:15,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:15,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:15,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:15,694 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2020-10-20 06:33:15,694 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:15,706 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 196#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 197#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 198#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 199#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 200#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 205#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 204#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 203#L13-3 assume !(main_~n~0 < 10); 195#L17-4 [2020-10-20 06:33:15,707 INFO L796 eck$LassoCheckResult]: Loop: 195#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 202#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 194#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 195#L17-4 [2020-10-20 06:33:15,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:15,707 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2020-10-20 06:33:15,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:15,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941688025] [2020-10-20 06:33:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:15,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941688025] [2020-10-20 06:33:15,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899529132] [2020-10-20 06:33:15,751 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:15,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 06:33:15,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:33:15,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:33:15,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:15,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:15,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 06:33:15,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736066167] [2020-10-20 06:33:15,807 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:15,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:15,807 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2020-10-20 06:33:15,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:15,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728201939] [2020-10-20 06:33:15,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:15,813 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:15,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:15,818 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:15,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:15,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:33:15,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:33:15,921 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-10-20 06:33:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:15,945 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-10-20 06:33:15,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:33:15,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-10-20 06:33:15,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:15,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2020-10-20 06:33:15,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:15,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:15,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2020-10-20 06:33:15,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:15,947 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-10-20 06:33:15,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2020-10-20 06:33:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-10-20 06:33:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-20 06:33:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-10-20 06:33:15,950 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-20 06:33:15,950 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-20 06:33:15,950 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:33:15,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2020-10-20 06:33:15,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:15,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:15,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:15,951 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2020-10-20 06:33:15,951 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:15,952 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 255#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 256#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 259#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 260#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 261#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 263#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 268#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 267#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 266#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 265#L13-3 assume !(main_~n~0 < 10); 258#L17-4 [2020-10-20 06:33:15,952 INFO L796 eck$LassoCheckResult]: Loop: 258#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 264#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 257#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 258#L17-4 [2020-10-20 06:33:15,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:15,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2020-10-20 06:33:15,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:15,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339120586] [2020-10-20 06:33:15,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:16,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339120586] [2020-10-20 06:33:16,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097603653] [2020-10-20 06:33:16,003 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:16,035 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:33:16,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:33:16,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:33:16,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:16,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:16,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 06:33:16,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906305219] [2020-10-20 06:33:16,060 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:16,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:16,061 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2020-10-20 06:33:16,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:16,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254849654] [2020-10-20 06:33:16,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:16,066 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:16,070 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:16,072 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:16,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:16,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:33:16,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:33:16,172 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2020-10-20 06:33:16,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:16,200 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-10-20 06:33:16,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 06:33:16,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2020-10-20 06:33:16,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:16,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2020-10-20 06:33:16,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:16,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:16,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-10-20 06:33:16,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:16,204 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-20 06:33:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-10-20 06:33:16,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-10-20 06:33:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-20 06:33:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-10-20 06:33:16,206 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-10-20 06:33:16,207 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-10-20 06:33:16,207 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:33:16,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2020-10-20 06:33:16,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:16,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:16,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:16,209 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2020-10-20 06:33:16,209 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:16,209 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 329#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 330#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 331#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 332#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 333#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 335#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 342#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 341#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 340#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 339#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 338#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 337#L13-3 assume !(main_~n~0 < 10); 328#L17-4 [2020-10-20 06:33:16,210 INFO L796 eck$LassoCheckResult]: Loop: 328#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 336#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 327#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 328#L17-4 [2020-10-20 06:33:16,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:16,210 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2020-10-20 06:33:16,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:16,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700907397] [2020-10-20 06:33:16,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:16,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700907397] [2020-10-20 06:33:16,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47603287] [2020-10-20 06:33:16,272 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:16,316 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-20 06:33:16,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:33:16,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:33:16,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:16,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:16,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-20 06:33:16,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649534938] [2020-10-20 06:33:16,342 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:16,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:16,343 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2020-10-20 06:33:16,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:16,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197674239] [2020-10-20 06:33:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:16,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:16,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:16,353 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:16,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:16,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:33:16,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:33:16,457 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2020-10-20 06:33:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:16,492 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-10-20 06:33:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:33:16,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2020-10-20 06:33:16,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:16,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2020-10-20 06:33:16,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:16,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:16,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2020-10-20 06:33:16,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:16,495 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-10-20 06:33:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2020-10-20 06:33:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-10-20 06:33:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 06:33:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-10-20 06:33:16,498 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-20 06:33:16,498 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-20 06:33:16,499 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:33:16,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-10-20 06:33:16,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:16,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:16,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:16,501 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2020-10-20 06:33:16,501 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:16,501 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 410#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 411#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 414#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 415#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 416#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 418#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 427#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 426#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 425#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 424#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 423#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 422#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 421#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 420#L13-3 assume !(main_~n~0 < 10); 413#L17-4 [2020-10-20 06:33:16,501 INFO L796 eck$LassoCheckResult]: Loop: 413#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 419#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 412#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 413#L17-4 [2020-10-20 06:33:16,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:16,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2020-10-20 06:33:16,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:16,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31853396] [2020-10-20 06:33:16,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:16,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31853396] [2020-10-20 06:33:16,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138784307] [2020-10-20 06:33:16,575 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:16,622 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-20 06:33:16,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:33:16,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:33:16,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:16,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:16,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-20 06:33:16,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669594276] [2020-10-20 06:33:16,646 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:16,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:16,647 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2020-10-20 06:33:16,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:16,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368514256] [2020-10-20 06:33:16,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:16,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:16,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:16,668 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:16,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:16,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:33:16,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:33:16,759 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2020-10-20 06:33:16,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:16,795 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-10-20 06:33:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:33:16,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2020-10-20 06:33:16,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:16,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2020-10-20 06:33:16,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:16,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:16,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2020-10-20 06:33:16,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:16,798 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-10-20 06:33:16,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2020-10-20 06:33:16,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-10-20 06:33:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 06:33:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-10-20 06:33:16,800 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-20 06:33:16,800 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-20 06:33:16,800 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:33:16,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2020-10-20 06:33:16,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:16,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:16,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:16,802 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2020-10-20 06:33:16,802 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:16,803 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 504#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 505#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 508#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 509#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 510#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 512#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 523#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 522#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 521#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 520#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 519#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 518#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 517#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 516#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 515#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 514#L13-3 assume !(main_~n~0 < 10); 507#L17-4 [2020-10-20 06:33:16,803 INFO L796 eck$LassoCheckResult]: Loop: 507#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 513#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 506#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 507#L17-4 [2020-10-20 06:33:16,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:16,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2020-10-20 06:33:16,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:16,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655102615] [2020-10-20 06:33:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:16,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655102615] [2020-10-20 06:33:16,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605763443] [2020-10-20 06:33:16,882 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:16,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:33:16,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:16,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:16,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-20 06:33:16,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217858269] [2020-10-20 06:33:16,964 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:16,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:16,965 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2020-10-20 06:33:16,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:16,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74137572] [2020-10-20 06:33:16,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:16,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:16,974 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:16,975 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:17,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:17,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:33:17,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:33:17,057 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2020-10-20 06:33:17,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:17,092 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-10-20 06:33:17,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:33:17,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2020-10-20 06:33:17,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:17,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2020-10-20 06:33:17,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:17,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:17,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2020-10-20 06:33:17,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:17,095 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-10-20 06:33:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2020-10-20 06:33:17,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-20 06:33:17,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 06:33:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-10-20 06:33:17,097 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-20 06:33:17,097 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-20 06:33:17,098 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:33:17,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2020-10-20 06:33:17,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:17,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:17,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:17,099 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2020-10-20 06:33:17,100 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:17,100 INFO L794 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 611#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 612#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 613#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 614#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 615#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 617#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 630#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 629#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 628#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 627#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 626#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 625#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 624#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 623#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 622#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 621#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 620#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 619#L13-3 assume !(main_~n~0 < 10); 610#L17-4 [2020-10-20 06:33:17,100 INFO L796 eck$LassoCheckResult]: Loop: 610#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 618#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 609#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 610#L17-4 [2020-10-20 06:33:17,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:17,101 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2020-10-20 06:33:17,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:17,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741206689] [2020-10-20 06:33:17,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:17,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741206689] [2020-10-20 06:33:17,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134582730] [2020-10-20 06:33:17,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:17,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:33:17,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:33:17,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:33:17,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:17,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:17,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-20 06:33:17,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998427319] [2020-10-20 06:33:17,279 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:17,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:17,279 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2020-10-20 06:33:17,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:17,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220994808] [2020-10-20 06:33:17,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:17,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:17,287 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:17,289 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:17,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:17,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:33:17,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:33:17,368 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2020-10-20 06:33:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:17,404 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-10-20 06:33:17,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:33:17,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2020-10-20 06:33:17,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:17,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2020-10-20 06:33:17,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:17,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:17,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2020-10-20 06:33:17,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:17,406 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-10-20 06:33:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2020-10-20 06:33:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-10-20 06:33:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 06:33:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-10-20 06:33:17,409 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-10-20 06:33:17,409 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-10-20 06:33:17,409 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:33:17,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2020-10-20 06:33:17,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:17,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:17,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:17,411 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2020-10-20 06:33:17,411 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:17,412 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 727#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 728#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 729#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 730#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 731#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 733#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 748#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 747#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 746#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 745#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 744#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 743#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 742#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 741#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 740#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 739#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 738#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 737#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 736#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 735#L13-3 assume !(main_~n~0 < 10); 726#L17-4 [2020-10-20 06:33:17,412 INFO L796 eck$LassoCheckResult]: Loop: 726#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 734#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 725#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 726#L17-4 [2020-10-20 06:33:17,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:17,412 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2020-10-20 06:33:17,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:17,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947673365] [2020-10-20 06:33:17,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:17,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947673365] [2020-10-20 06:33:17,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324420558] [2020-10-20 06:33:17,524 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:17,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-10-20 06:33:17,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:33:17,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:33:17,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:17,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:17,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-20 06:33:17,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618111071] [2020-10-20 06:33:17,664 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:17,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:17,665 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2020-10-20 06:33:17,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:17,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347379382] [2020-10-20 06:33:17,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:17,671 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:17,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:17,682 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:17,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:17,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 06:33:17,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:33:17,768 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2020-10-20 06:33:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:17,823 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-10-20 06:33:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:33:17,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-10-20 06:33:17,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:17,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2020-10-20 06:33:17,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:17,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:17,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2020-10-20 06:33:17,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:17,825 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-10-20 06:33:17,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2020-10-20 06:33:17,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-10-20 06:33:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-20 06:33:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-10-20 06:33:17,828 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-10-20 06:33:17,828 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-10-20 06:33:17,828 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 06:33:17,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2020-10-20 06:33:17,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:17,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:17,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:17,830 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2020-10-20 06:33:17,830 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:17,830 INFO L794 eck$LassoCheckResult]: Stem: 858#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 853#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 854#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 855#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 856#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 857#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 859#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 876#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 875#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 874#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 873#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 872#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 871#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 870#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 869#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 868#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 867#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 866#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 865#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 864#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 863#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 862#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 861#L13-3 assume !(main_~n~0 < 10); 852#L17-4 [2020-10-20 06:33:17,831 INFO L796 eck$LassoCheckResult]: Loop: 852#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 860#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 851#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 852#L17-4 [2020-10-20 06:33:17,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:17,831 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2020-10-20 06:33:17,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:17,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474810199] [2020-10-20 06:33:17,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:17,844 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:17,855 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:17,861 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:17,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:17,862 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2020-10-20 06:33:17,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:17,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690532513] [2020-10-20 06:33:17,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:17,865 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:17,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:17,869 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:17,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:17,870 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2020-10-20 06:33:17,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:17,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878742105] [2020-10-20 06:33:17,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:17,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:17,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:17,904 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:22,169 WARN L193 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 212 DAG size of output: 146 [2020-10-20 06:33:22,395 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-20 06:33:22,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:33:22 BoogieIcfgContainer [2020-10-20 06:33:22,436 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:33:22,437 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:33:22,437 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:33:22,437 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:33:22,438 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:33:13" (3/4) ... [2020-10-20 06:33:22,441 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:33:22,490 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:33:22,491 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:33:22,493 INFO L168 Benchmark]: Toolchain (without parser) took 9957.36 ms. Allocated memory was 36.2 MB in the beginning and 76.0 MB in the end (delta: 39.8 MB). Free memory was 17.2 MB in the beginning and 24.6 MB in the end (delta: -7.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:33:22,493 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 34.1 MB. Free memory was 10.2 MB in the beginning and 10.2 MB in the end (delta: 45.5 kB). Peak memory consumption was 45.5 kB. Max. memory is 14.3 GB. [2020-10-20 06:33:22,495 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.63 ms. Allocated memory was 36.2 MB in the beginning and 44.6 MB in the end (delta: 8.4 MB). Free memory was 16.3 MB in the beginning and 26.9 MB in the end (delta: -10.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:33:22,495 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.04 ms. Allocated memory is still 44.6 MB. Free memory was 26.9 MB in the beginning and 25.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:33:22,496 INFO L168 Benchmark]: Boogie Preprocessor took 23.51 ms. Allocated memory is still 44.6 MB. Free memory was 25.3 MB in the beginning and 23.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:33:22,497 INFO L168 Benchmark]: RCFGBuilder took 274.51 ms. Allocated memory was 44.6 MB in the beginning and 46.7 MB in the end (delta: 2.1 MB). Free memory was 23.9 MB in the beginning and 24.5 MB in the end (delta: -605.4 kB). Peak memory consumption was 12.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:33:22,497 INFO L168 Benchmark]: BuchiAutomizer took 9251.62 ms. Allocated memory was 46.7 MB in the beginning and 76.0 MB in the end (delta: 29.4 MB). Free memory was 24.5 MB in the beginning and 27.4 MB in the end (delta: -3.0 MB). Peak memory consumption was 46.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:33:22,498 INFO L168 Benchmark]: Witness Printer took 54.35 ms. Allocated memory is still 76.0 MB. Free memory was 27.4 MB in the beginning and 24.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:33:22,501 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.26 ms. Allocated memory is still 34.1 MB. Free memory was 10.2 MB in the beginning and 10.2 MB in the end (delta: 45.5 kB). Peak memory consumption was 45.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 314.63 ms. Allocated memory was 36.2 MB in the beginning and 44.6 MB in the end (delta: 8.4 MB). Free memory was 16.3 MB in the beginning and 26.9 MB in the end (delta: -10.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 29.04 ms. Allocated memory is still 44.6 MB. Free memory was 26.9 MB in the beginning and 25.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 23.51 ms. Allocated memory is still 44.6 MB. Free memory was 25.3 MB in the beginning and 23.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. * RCFGBuilder took 274.51 ms. Allocated memory was 44.6 MB in the beginning and 46.7 MB in the end (delta: 2.1 MB). Free memory was 23.9 MB in the beginning and 24.5 MB in the end (delta: -605.4 kB). Peak memory consumption was 12.5 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 9251.62 ms. Allocated memory was 46.7 MB in the beginning and 76.0 MB in the end (delta: 29.4 MB). Free memory was 24.5 MB in the beginning and 27.4 MB in the end (delta: -3.0 MB). Peak memory consumption was 46.5 MB. Max. memory is 14.3 GB. * Witness Printer took 54.35 ms. Allocated memory is still 76.0 MB. Free memory was 27.4 MB in the beginning and 24.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 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 11 terminating modules (10 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * n + 19 and consists of 5 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 8.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 65 SDslu, 251 SDs, 0 SdLazy, 188 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital88 mio100 ax100 hnf100 lsp93 ukn59 mio100 lsp69 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms 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: 17]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@73b500a8=0, NULL=0, \result=0, NULL=1, n=10, i=8, a=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78db1b77=8, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@614fdf5d=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b0399b1=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63897e11=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@2c96fb1f=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...