./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 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../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.24-30f4e4a [2019-11-28 02:56:38,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:56:38,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:56:38,660 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:56:38,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:56:38,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:56:38,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:56:38,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:56:38,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:56:38,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:56:38,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:56:38,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:56:38,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:56:38,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:56:38,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:56:38,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:56:38,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:56:38,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:56:38,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:56:38,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:56:38,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:56:38,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:56:38,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:56:38,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:56:38,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:56:38,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:56:38,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:56:38,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:56:38,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:56:38,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:56:38,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:56:38,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:56:38,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:56:38,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:56:38,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:56:38,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:56:38,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:56:38,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:56:38,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:56:38,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:56:38,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:56:38,703 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 02:56:38,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:56:38,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:56:38,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:56:38,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:56:38,725 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:56:38,725 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 02:56:38,725 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 02:56:38,726 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 02:56:38,726 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 02:56:38,726 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 02:56:38,726 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 02:56:38,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:56:38,727 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:56:38,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:56:38,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:56:38,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 02:56:38,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 02:56:38,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 02:56:38,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:56:38,729 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 02:56:38,729 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:56:38,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 02:56:38,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:56:38,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:56:38,730 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 02:56:38,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:56:38,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:56:38,731 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 02:56:38,732 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 02:56:38,733 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 [2019-11-28 02:56:39,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:56:39,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:56:39,081 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:56:39,082 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:56:39,083 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:56:39,084 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2019-11-28 02:56:39,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df6699d1/5915bb02dcfa4882a1e26d170ba5cf33/FLAG1b1d8aff9 [2019-11-28 02:56:39,638 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:56:39,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2019-11-28 02:56:39,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df6699d1/5915bb02dcfa4882a1e26d170ba5cf33/FLAG1b1d8aff9 [2019-11-28 02:56:40,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df6699d1/5915bb02dcfa4882a1e26d170ba5cf33 [2019-11-28 02:56:40,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:56:40,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:56:40,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:56:40,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:56:40,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:56:40,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:56:40" (1/1) ... [2019-11-28 02:56:40,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5893cfee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:40, skipping insertion in model container [2019-11-28 02:56:40,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:56:40" (1/1) ... [2019-11-28 02:56:40,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:56:40,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:56:40,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:56:40,356 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:56:40,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:56:40,404 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:56:40,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:40 WrapperNode [2019-11-28 02:56:40,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:56:40,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:56:40,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:56:40,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:56:40,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:40" (1/1) ... [2019-11-28 02:56:40,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:40" (1/1) ... [2019-11-28 02:56:40,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:56:40,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:56:40,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:56:40,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:56:40,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:40" (1/1) ... [2019-11-28 02:56:40,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:40" (1/1) ... [2019-11-28 02:56:40,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:40" (1/1) ... [2019-11-28 02:56:40,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:40" (1/1) ... [2019-11-28 02:56:40,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:40" (1/1) ... [2019-11-28 02:56:40,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:40" (1/1) ... [2019-11-28 02:56:40,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:40" (1/1) ... [2019-11-28 02:56:40,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:56:40,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:56:40,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:56:40,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:56:40,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:56:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:56:40,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:56:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:56:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:56:40,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:56:40,851 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:56:40,852 INFO L297 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 02:56:40,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:40 BoogieIcfgContainer [2019-11-28 02:56:40,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:56:40,855 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 02:56:40,855 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 02:56:40,866 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 02:56:40,871 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:56:40,871 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:56:40" (1/3) ... [2019-11-28 02:56:40,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dede284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:56:40, skipping insertion in model container [2019-11-28 02:56:40,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:56:40,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:40" (2/3) ... [2019-11-28 02:56:40,876 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dede284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:56:40, skipping insertion in model container [2019-11-28 02:56:40,876 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:56:40,877 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:40" (3/3) ... [2019-11-28 02:56:40,878 INFO L371 chiAutomizerObserver]: Analyzing ICFG NonTermination3-2.c [2019-11-28 02:56:40,935 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 02:56:40,936 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 02:56:40,936 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 02:56:40,936 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:56:40,936 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:56:40,937 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 02:56:40,937 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:56:40,937 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 02:56:40,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-28 02:56:40,976 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 02:56:40,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:40,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:40,985 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 02:56:40,985 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 02:56:40,986 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 02:56:40,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-28 02:56:40,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 02:56:40,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:40,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:40,988 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 02:56:40,989 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 02:56:40,997 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 [2019-11-28 02:56:40,998 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 [2019-11-28 02:56:41,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:41,005 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 02:56:41,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:41,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811060768] [2019-11-28 02:56:41,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:41,145 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:41,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-28 02:56:41,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:41,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902904666] [2019-11-28 02:56:41,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:41,168 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:41,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:41,171 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-28 02:56:41,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:41,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98259204] [2019-11-28 02:56:41,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:41,213 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:41,441 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-28 02:56:41,494 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:56:41,495 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:56:41,495 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:56:41,495 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:56:41,496 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:56:41,496 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:41,496 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:56:41,496 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:56:41,497 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-2.c_Iteration1_Lasso [2019-11-28 02:56:41,497 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:56:41,497 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:56:41,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:41,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:41,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:41,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:41,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:41,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:41,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:41,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:41,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:41,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:56:41,799 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:56:41,805 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:41,818 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 [2019-11-28 02:56:41,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:41,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:41,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:41,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:41,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:41,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:41,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:56:41,828 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) [2019-11-28 02:56:41,845 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 [2019-11-28 02:56:41,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:41,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:41,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:41,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:41,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:41,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:41,849 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 [2019-11-28 02:56:41,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:41,870 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 [2019-11-28 02:56:41,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:41,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:41,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:41,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:41,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:41,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:41,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:56:41,879 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:41,891 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 [2019-11-28 02:56:41,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:41,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:41,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:41,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:41,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:41,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:56:41,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:41,918 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 [2019-11-28 02:56:41,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:41,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:41,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:41,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:41,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:41,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:56:41,931 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) [2019-11-28 02:56:41,944 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 [2019-11-28 02:56:41,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:41,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:41,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:41,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:41,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:41,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:41,966 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) [2019-11-28 02:56:41,978 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 [2019-11-28 02:56:41,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:41,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:41,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:41,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:41,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:41,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:41,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:41,984 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:41,994 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 [2019-11-28 02:56:41,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:41,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:56:41,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:41,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:41,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:41,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:56:41,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:56:42,002 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) [2019-11-28 02:56:42,014 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 [2019-11-28 02:56:42,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:56:42,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:56:42,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:56:42,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:56:42,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:56:42,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:42,035 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:56:42,064 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 02:56:42,065 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:56:42,072 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:56:42,078 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 02:56:42,078 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:56:42,079 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2019-11-28 02:56:42,089 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-28 02:56:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:42,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:56:42,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:42,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:56:42,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:42,187 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:56:42,188 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2019-11-28 02:56:42,245 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2019-11-28 02:56:42,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:56:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:56:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-11-28 02:56:42,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-28 02:56:42,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:42,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 02:56:42,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:42,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-28 02:56:42,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:56:42,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2019-11-28 02:56:42,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:42,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2019-11-28 02:56:42,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:56:42,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 02:56:42,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-11-28 02:56:42,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:56:42,264 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-28 02:56:42,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-11-28 02:56:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-28 02:56:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:56:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-11-28 02:56:42,295 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-11-28 02:56:42,296 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-11-28 02:56:42,296 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 02:56:42,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2019-11-28 02:56:42,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:42,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:42,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:42,297 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 02:56:42,297 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:56:42,298 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 [2019-11-28 02:56:42,298 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 [2019-11-28 02:56:42,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:42,299 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2019-11-28 02:56:42,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:42,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366000950] [2019-11-28 02:56:42,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:42,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366000950] [2019-11-28 02:56:42,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:56:42,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:56:42,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816672933] [2019-11-28 02:56:42,374 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:56:42,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:42,376 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2019-11-28 02:56:42,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:42,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488440100] [2019-11-28 02:56:42,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:42,431 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:42,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:56:42,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:56:42,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:56:42,571 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-28 02:56:42,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:56:42,586 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-11-28 02:56:42,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:56:42,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-11-28 02:56:42,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:42,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2019-11-28 02:56:42,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:56:42,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-28 02:56:42,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-11-28 02:56:42,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:56:42,591 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-28 02:56:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-11-28 02:56:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-28 02:56:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:56:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-11-28 02:56:42,594 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-28 02:56:42,594 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-28 02:56:42,594 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 02:56:42,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-11-28 02:56:42,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:42,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:42,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:42,596 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 02:56:42,596 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:56:42,596 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 [2019-11-28 02:56:42,596 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 [2019-11-28 02:56:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:42,597 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2019-11-28 02:56:42,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:42,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104627878] [2019-11-28 02:56:42,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:42,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104627878] [2019-11-28 02:56:42,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823406084] [2019-11-28 02:56:42,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:56:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:42,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:56:42,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:42,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:56:42,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-11-28 02:56:42,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069406794] [2019-11-28 02:56:42,705 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:56:42,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:42,705 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2019-11-28 02:56:42,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:42,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231800560] [2019-11-28 02:56:42,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:42,723 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:42,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:56:42,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:56:42,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:56:42,848 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-11-28 02:56:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:56:42,871 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-11-28 02:56:42,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:56:42,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-11-28 02:56:42,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:42,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-11-28 02:56:42,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:56:42,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-28 02:56:42,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-11-28 02:56:42,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:56:42,876 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-11-28 02:56:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-11-28 02:56:42,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-28 02:56:42,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 02:56:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-11-28 02:56:42,879 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-28 02:56:42,879 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-28 02:56:42,879 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 02:56:42,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-11-28 02:56:42,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:42,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:42,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:42,883 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2019-11-28 02:56:42,883 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:56:42,883 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 [2019-11-28 02:56:42,883 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 [2019-11-28 02:56:42,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:42,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2019-11-28 02:56:42,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:42,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076768221] [2019-11-28 02:56:42,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:42,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076768221] [2019-11-28 02:56:42,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315246765] [2019-11-28 02:56:42,944 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:56:42,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:56:42,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:56:42,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:56:42,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:43,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:56:43,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-28 02:56:43,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960888930] [2019-11-28 02:56:43,002 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:56:43,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:43,003 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2019-11-28 02:56:43,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:43,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826140767] [2019-11-28 02:56:43,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:43,044 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:43,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:56:43,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:56:43,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:56:43,168 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-11-28 02:56:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:56:43,191 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-11-28 02:56:43,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:56:43,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-11-28 02:56:43,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:43,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2019-11-28 02:56:43,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:56:43,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-28 02:56:43,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-11-28 02:56:43,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:56:43,194 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-28 02:56:43,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-11-28 02:56:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-28 02:56:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 02:56:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-11-28 02:56:43,197 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-28 02:56:43,197 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-28 02:56:43,197 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 02:56:43,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2019-11-28 02:56:43,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:43,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:43,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:43,200 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2019-11-28 02:56:43,200 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:56:43,200 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 [2019-11-28 02:56:43,200 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 [2019-11-28 02:56:43,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:43,201 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2019-11-28 02:56:43,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:43,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688599471] [2019-11-28 02:56:43,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:43,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688599471] [2019-11-28 02:56:43,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904165386] [2019-11-28 02:56:43,289 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:56:43,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 02:56:43,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:56:43,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:56:43,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:43,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:56:43,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-28 02:56:43,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701861564] [2019-11-28 02:56:43,349 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:56:43,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:43,350 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2019-11-28 02:56:43,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:43,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115813004] [2019-11-28 02:56:43,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:43,369 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:43,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:56:43,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:56:43,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:56:43,486 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-11-28 02:56:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:56:43,521 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-28 02:56:43,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:56:43,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-11-28 02:56:43,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:43,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2019-11-28 02:56:43,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:56:43,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-28 02:56:43,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2019-11-28 02:56:43,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:56:43,525 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-28 02:56:43,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2019-11-28 02:56:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-28 02:56:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 02:56:43,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-28 02:56:43,528 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-28 02:56:43,528 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-28 02:56:43,528 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 02:56:43,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-11-28 02:56:43,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:43,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:43,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:43,530 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2019-11-28 02:56:43,530 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:56:43,530 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 [2019-11-28 02:56:43,530 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 [2019-11-28 02:56:43,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:43,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2019-11-28 02:56:43,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:43,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055201194] [2019-11-28 02:56:43,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:43,589 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:43,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055201194] [2019-11-28 02:56:43,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509685838] [2019-11-28 02:56:43,591 INFO L92 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 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 [2019-11-28 02:56:43,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:56:43,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:56:43,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:56:43,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:43,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:56:43,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-28 02:56:43,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070624412] [2019-11-28 02:56:43,652 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:56:43,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:43,653 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2019-11-28 02:56:43,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:43,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564294573] [2019-11-28 02:56:43,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:43,665 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:43,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:56:43,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:56:43,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:56:43,803 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2019-11-28 02:56:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:56:43,834 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-11-28 02:56:43,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:56:43,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-11-28 02:56:43,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:43,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-11-28 02:56:43,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:56:43,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-28 02:56:43,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-11-28 02:56:43,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:56:43,837 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-28 02:56:43,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-11-28 02:56:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-28 02:56:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 02:56:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-11-28 02:56:43,839 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-28 02:56:43,839 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-28 02:56:43,839 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 02:56:43,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2019-11-28 02:56:43,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:43,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:43,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:43,841 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2019-11-28 02:56:43,841 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:56:43,841 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 [2019-11-28 02:56:43,841 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 [2019-11-28 02:56:43,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:43,841 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2019-11-28 02:56:43,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:43,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912454778] [2019-11-28 02:56:43,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:43,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912454778] [2019-11-28 02:56:43,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679336997] [2019-11-28 02:56:43,911 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_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 [2019-11-28 02:56:43,958 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 02:56:43,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:56:43,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:56:43,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:43,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:56:43,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-28 02:56:43,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518524947] [2019-11-28 02:56:43,971 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:56:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:43,972 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2019-11-28 02:56:43,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:43,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357286098] [2019-11-28 02:56:43,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:43,983 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:44,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:56:44,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:56:44,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:56:44,088 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-11-28 02:56:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:56:44,131 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-11-28 02:56:44,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:56:44,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2019-11-28 02:56:44,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:44,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2019-11-28 02:56:44,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:56:44,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-28 02:56:44,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2019-11-28 02:56:44,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:56:44,139 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-28 02:56:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2019-11-28 02:56:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-28 02:56:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 02:56:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-28 02:56:44,143 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-28 02:56:44,144 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-28 02:56:44,144 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 02:56:44,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-28 02:56:44,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:44,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:44,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:44,146 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2019-11-28 02:56:44,148 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:56:44,148 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 [2019-11-28 02:56:44,148 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 [2019-11-28 02:56:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:44,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2019-11-28 02:56:44,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:44,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903729218] [2019-11-28 02:56:44,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:44,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903729218] [2019-11-28 02:56:44,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279284929] [2019-11-28 02:56:44,257 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-11-28 02:56:44,307 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 02:56:44,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:56:44,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:56:44,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:44,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:56:44,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-28 02:56:44,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078752492] [2019-11-28 02:56:44,326 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:56:44,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:44,329 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2019-11-28 02:56:44,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:44,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664120668] [2019-11-28 02:56:44,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:44,347 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:44,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:56:44,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:56:44,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:56:44,435 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2019-11-28 02:56:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:56:44,478 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-11-28 02:56:44,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:56:44,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2019-11-28 02:56:44,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:44,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2019-11-28 02:56:44,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:56:44,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-28 02:56:44,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2019-11-28 02:56:44,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:56:44,484 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-28 02:56:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2019-11-28 02:56:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-28 02:56:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 02:56:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-11-28 02:56:44,486 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-28 02:56:44,486 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-28 02:56:44,487 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 02:56:44,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2019-11-28 02:56:44,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:44,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:44,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:44,488 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2019-11-28 02:56:44,488 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:56:44,489 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 [2019-11-28 02:56:44,489 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 [2019-11-28 02:56:44,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:44,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2019-11-28 02:56:44,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:44,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737443935] [2019-11-28 02:56:44,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:44,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737443935] [2019-11-28 02:56:44,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959122155] [2019-11-28 02:56:44,573 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2019-11-28 02:56:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:44,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:56:44,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:44,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:56:44,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-28 02:56:44,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662971858] [2019-11-28 02:56:44,644 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:56:44,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:44,646 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2019-11-28 02:56:44,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:44,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890092910] [2019-11-28 02:56:44,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:44,671 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:44,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:56:44,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:56:44,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:56:44,786 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2019-11-28 02:56:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:56:44,830 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-11-28 02:56:44,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:56:44,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2019-11-28 02:56:44,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:44,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2019-11-28 02:56:44,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:56:44,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-28 02:56:44,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-11-28 02:56:44,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:56:44,833 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-28 02:56:44,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-11-28 02:56:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-28 02:56:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 02:56:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-28 02:56:44,835 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-28 02:56:44,835 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-28 02:56:44,835 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 02:56:44,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-11-28 02:56:44,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:44,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:44,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:44,837 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2019-11-28 02:56:44,837 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:56:44,837 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 [2019-11-28 02:56:44,837 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 [2019-11-28 02:56:44,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:44,838 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2019-11-28 02:56:44,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:44,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994440045] [2019-11-28 02:56:44,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:44,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994440045] [2019-11-28 02:56:44,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702655410] [2019-11-28 02:56:44,948 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_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 [2019-11-28 02:56:44,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:56:44,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:56:44,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:56:44,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:45,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:56:45,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-28 02:56:45,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62741461] [2019-11-28 02:56:45,007 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:56:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:45,008 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2019-11-28 02:56:45,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:45,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535592891] [2019-11-28 02:56:45,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:45,019 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:45,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:56:45,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:56:45,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:56:45,103 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2019-11-28 02:56:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:56:45,139 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-11-28 02:56:45,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:56:45,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2019-11-28 02:56:45,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:45,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2019-11-28 02:56:45,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:56:45,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-28 02:56:45,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2019-11-28 02:56:45,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:56:45,145 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-11-28 02:56:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2019-11-28 02:56:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-28 02:56:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 02:56:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-28 02:56:45,147 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-28 02:56:45,147 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-28 02:56:45,147 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 02:56:45,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2019-11-28 02:56:45,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:45,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:45,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:45,149 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2019-11-28 02:56:45,149 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:56:45,149 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 [2019-11-28 02:56:45,149 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 [2019-11-28 02:56:45,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:45,149 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2019-11-28 02:56:45,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:45,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519368433] [2019-11-28 02:56:45,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:56:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:45,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519368433] [2019-11-28 02:56:45,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548796627] [2019-11-28 02:56:45,238 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-11-28 02:56:45,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-28 02:56:45,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:56:45,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:56:45,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:56:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:56:45,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:56:45,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-28 02:56:45,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609325354] [2019-11-28 02:56:45,320 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:56:45,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:45,320 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2019-11-28 02:56:45,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:45,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783500676] [2019-11-28 02:56:45,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:45,339 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:45,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:56:45,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:56:45,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:56:45,435 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2019-11-28 02:56:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:56:45,496 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-28 02:56:45,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:56:45,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-11-28 02:56:45,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:45,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2019-11-28 02:56:45,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 02:56:45,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-28 02:56:45,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2019-11-28 02:56:45,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:56:45,498 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-28 02:56:45,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2019-11-28 02:56:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 02:56:45,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 02:56:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-28 02:56:45,501 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-28 02:56:45,501 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-28 02:56:45,501 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 02:56:45,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2019-11-28 02:56:45,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:56:45,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:56:45,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:56:45,502 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2019-11-28 02:56:45,502 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:56:45,503 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 [2019-11-28 02:56:45,503 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 [2019-11-28 02:56:45,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:45,503 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2019-11-28 02:56:45,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:45,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848696485] [2019-11-28 02:56:45,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:45,532 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:45,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:45,533 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2019-11-28 02:56:45,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:45,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015835098] [2019-11-28 02:56:45,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:45,541 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:45,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:56:45,542 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2019-11-28 02:56:45,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:56:45,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521132768] [2019-11-28 02:56:45,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:56:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:56:45,612 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:56:48,338 WARN L192 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 212 DAG size of output: 148 [2019-11-28 02:56:48,582 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 02:56:48,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 02:56:48 BoogieIcfgContainer [2019-11-28 02:56:48,636 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 02:56:48,637 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:56:48,637 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:56:48,637 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:56:48,638 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:40" (3/4) ... [2019-11-28 02:56:48,641 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 02:56:48,695 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:56:48,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:56:48,697 INFO L168 Benchmark]: Toolchain (without parser) took 8633.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 960.4 MB in the beginning and 820.3 MB in the end (delta: 140.1 MB). Peak memory consumption was 334.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:56:48,697 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:56:48,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.56 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:56:48,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:56:48,699 INFO L168 Benchmark]: Boogie Preprocessor took 32.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:56:48,700 INFO L168 Benchmark]: RCFGBuilder took 314.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:56:48,701 INFO L168 Benchmark]: BuchiAutomizer took 7781.41 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 827.4 MB in the end (delta: 252.8 MB). Peak memory consumption was 335.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:56:48,701 INFO L168 Benchmark]: Witness Printer took 58.67 ms. Allocated memory is still 1.2 GB. Free memory was 827.4 MB in the beginning and 820.3 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:56:48,705 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.56 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 314.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7781.41 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 827.4 MB in the end (delta: 252.8 MB). Peak memory consumption was 335.6 MB. Max. memory is 11.5 GB. * Witness Printer took 58.67 ms. Allocated memory is still 1.2 GB. Free memory was 827.4 MB in the beginning and 820.3 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 7.6s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 6.9s. 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: 26ms VariablesStem: 1 VariablesLoop: 1 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@54ec26e4=0, NULL=0, \result=0, NULL=1, n=10, i=4, a=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cca57b5=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@2df33fff=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72da4b1c=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7adc3737=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@423dcd35=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...