./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-2.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/NonTermination3-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b10c0555613e3e1e99ee574b69e31152fe0aa7f9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:27:27,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:27:27,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:27:27,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:27:27,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:27:27,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:27:27,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:27:27,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:27:27,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:27:27,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:27:27,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:27:27,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:27:27,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:27:27,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:27:27,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:27:27,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:27:27,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:27:27,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:27:27,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:27:27,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:27:27,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:27:27,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:27:27,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:27:27,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:27:27,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:27:27,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:27:27,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:27:27,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:27:27,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:27:27,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:27:27,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:27:27,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:27:27,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:27:27,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:27:27,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:27:27,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:27:27,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:27:27,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:27:27,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:27:27,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:27:27,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:27:27,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:27:27,815 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:27:27,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:27:27,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:27:27,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:27:27,817 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:27:27,817 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:27:27,818 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:27:27,818 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:27:27,818 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:27:27,819 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:27:27,819 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:27:27,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:27:27,819 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:27:27,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:27:27,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:27:27,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:27:27,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:27:27,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:27:27,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:27:27,821 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:27:27,821 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:27:27,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:27:27,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:27:27,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:27:27,823 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:27:27,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:27:27,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:27:27,823 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:27:27,824 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:27:27,825 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:27:27,825 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b10c0555613e3e1e99ee574b69e31152fe0aa7f9 [2020-07-29 01:27:28,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:27:28,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:27:28,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:27:28,168 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:27:28,169 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:27:28,170 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2020-07-29 01:27:28,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9324f1cdc/456bcea3f98e44eeb3ebc26a7925a96a/FLAG9a1e15629 [2020-07-29 01:27:28,670 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:27:28,670 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2020-07-29 01:27:28,678 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9324f1cdc/456bcea3f98e44eeb3ebc26a7925a96a/FLAG9a1e15629 [2020-07-29 01:27:29,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9324f1cdc/456bcea3f98e44eeb3ebc26a7925a96a [2020-07-29 01:27:29,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:27:29,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:27:29,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:27:29,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:27:29,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:27:29,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:27:29" (1/1) ... [2020-07-29 01:27:29,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f8ec6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:29, skipping insertion in model container [2020-07-29 01:27:29,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:27:29" (1/1) ... [2020-07-29 01:27:29,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:27:29,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:27:29,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:27:29,298 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:27:29,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:27:29,347 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:27:29,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:29 WrapperNode [2020-07-29 01:27:29,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:27:29,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:27:29,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:27:29,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:27:29,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:29" (1/1) ... [2020-07-29 01:27:29,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:29" (1/1) ... [2020-07-29 01:27:29,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:27:29,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:27:29,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:27:29,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:27:29,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:29" (1/1) ... [2020-07-29 01:27:29,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:29" (1/1) ... [2020-07-29 01:27:29,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:29" (1/1) ... [2020-07-29 01:27:29,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:29" (1/1) ... [2020-07-29 01:27:29,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:29" (1/1) ... [2020-07-29 01:27:29,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:29" (1/1) ... [2020-07-29 01:27:29,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:29" (1/1) ... [2020-07-29 01:27:29,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:27:29,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:27:29,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:27:29,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:27:29,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:27:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:27:29,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:27:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:27:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:27:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:27:29,845 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:27:29,845 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:27:29,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:27:29 BoogieIcfgContainer [2020-07-29 01:27:29,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:27:29,851 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:27:29,851 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:27:29,856 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:27:29,858 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:29,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:27:29" (1/3) ... [2020-07-29 01:27:29,866 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f65dfb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:27:29, skipping insertion in model container [2020-07-29 01:27:29,867 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:29,867 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:29" (2/3) ... [2020-07-29 01:27:29,868 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f65dfb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:27:29, skipping insertion in model container [2020-07-29 01:27:29,868 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:29,868 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:27:29" (3/3) ... [2020-07-29 01:27:29,874 INFO L371 chiAutomizerObserver]: Analyzing ICFG NonTermination3-2.c [2020-07-29 01:27:29,978 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:27:29,979 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:27:29,979 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:27:29,980 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:27:29,980 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:27:29,980 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:27:29,980 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:27:29,981 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:27:29,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:27:30,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:27:30,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:30,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:30,028 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:27:30,028 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:27:30,028 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:27:30,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:27:30,031 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:27:30,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:30,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:30,032 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:27:30,032 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:27:30,038 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 5#L13-3true [2020-07-29 01:27:30,039 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-3true assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 8#L13-2true main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 5#L13-3true [2020-07-29 01:27:30,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:30,044 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:27:30,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:30,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726012440] [2020-07-29 01:27:30,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:30,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:30,155 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:30,177 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-07-29 01:27:30,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:30,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603633966] [2020-07-29 01:27:30,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:30,190 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:30,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:30,201 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:30,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:30,203 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-07-29 01:27:30,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:30,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576228688] [2020-07-29 01:27:30,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:30,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:30,241 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:30,245 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:30,492 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:30,493 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:30,493 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:30,493 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:30,493 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:30,494 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:30,494 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:30,494 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:30,494 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-2.c_Iteration1_Lasso [2020-07-29 01:27:30,495 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:30,495 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:30,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:30,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:30,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:30,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:30,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:30,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:30,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:30,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:30,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:30,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:27:31,102 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:31,108 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:31,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:31,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:31,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:31,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:31,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:31,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:31,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:31,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:31,138 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:31,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:31,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:31,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:31,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:31,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:31,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:31,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:31,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:31,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:31,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:31,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:31,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:31,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:31,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:31,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:31,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:31,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:31,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:31,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:31,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:31,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:31,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:31,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:31,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:27:31,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:31,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:31,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:31,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:31,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:31,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:31,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:31,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:27:31,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:27:31,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:31,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:31,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:31,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:31,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:31,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:31,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:27:31,424 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 [2020-07-29 01:27:31,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:31,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:31,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:31,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:31,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:31,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:31,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:31,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:31,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:31,484 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 [2020-07-29 01:27:31,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:31,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:31,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:31,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:31,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:31,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:31,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:31,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:31,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:31,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:31,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:31,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:31,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:31,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:31,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:27:31,596 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 [2020-07-29 01:27:31,612 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:31,646 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 01:27:31,647 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:31,656 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:31,660 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:27:31,660 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:31,661 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2020-07-29 01:27:31,709 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:27:31,715 INFO L393 LassoCheck]: Loop: "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;" "main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1;" [2020-07-29 01:27:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:31,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:31,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:27:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:31,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:31,810 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2020-07-29 01:27:31,812 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#unseeded} 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; {21#unseeded} is VALID [2020-07-29 01:27:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:31,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:31,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:31,854 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~n~0) 19))} 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; {47#(and (< ULTIMATE.start_main_~n~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~n~0))))} is VALID [2020-07-29 01:27:31,856 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(and (< ULTIMATE.start_main_~n~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~n~0))))} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {39#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~n~0) 19)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:31,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:27:31,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:31,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:31,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:31,893 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:27:31,894 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2020-07-29 01:27:32,020 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2020-07-29 01:27:32,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:32,020 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:32,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:27:32,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:27:32,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:32,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:32,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:27:32,029 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:27:32,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:32,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:32,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 40 transitions. [2020-07-29 01:27:32,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:32,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:32,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:32,034 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states. [2020-07-29 01:27:32,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:27:32,037 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:27:32,037 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:27:32,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:27:32,040 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:27:32,040 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 40 transitions. cyclomatic complexity: 16 [2020-07-29 01:27:32,041 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:32,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:32,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:32,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:32,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:32,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:32,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:32,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:32,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:32,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:32,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:27:32,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:27:32,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:27:32,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:27:32,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:27:32,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:27:32,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:32,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:32,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:32,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:32,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:32,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:32,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:32,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:32,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:32,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:32,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:32,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:32,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:32,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:32,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:32,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:27:32,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:27:32,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:27:32,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:27:32,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:27:32,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:27:32,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:32,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:32,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:32,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:32,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:32,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:32,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:32,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:32,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:32,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:32,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:32,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:32,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,063 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:27:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-07-29 01:27:32,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:32,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:27:32,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:27:32,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:32,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. cyclomatic complexity: 16 [2020-07-29 01:27:32,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:32,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2020-07-29 01:27:32,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:32,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:27:32,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-07-29 01:27:32,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:32,090 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-07-29 01:27:32,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-07-29 01:27:32,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-07-29 01:27:32,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:32,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 12 transitions. Second operand 8 states. [2020-07-29 01:27:32,121 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 12 transitions. Second operand 8 states. [2020-07-29 01:27:32,124 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 8 states. [2020-07-29 01:27:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:32,129 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2020-07-29 01:27:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2020-07-29 01:27:32,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:32,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:32,131 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states and 12 transitions. [2020-07-29 01:27:32,131 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states and 12 transitions. [2020-07-29 01:27:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:32,132 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2020-07-29 01:27:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2020-07-29 01:27:32,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:32,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:32,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:32,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:27:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-07-29 01:27:32,136 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:27:32,136 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:27:32,136 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:27:32,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:27:32,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:32,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:32,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:32,141 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:27:32,141 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:32,141 INFO L794 eck$LassoCheckResult]: Stem: 95#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 89#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; 90#L13-3 assume !(main_~n~0 < 10); 92#L17-4 [2020-07-29 01:27:32,142 INFO L796 eck$LassoCheckResult]: Loop: 92#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 96#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; 91#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;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; 92#L17-4 [2020-07-29 01:27:32,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:32,142 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2020-07-29 01:27:32,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:32,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691443285] [2020-07-29 01:27:32,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:32,199 INFO L280 TraceCheckUtils]: 0: Hoare triple {118#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {118#true} is VALID [2020-07-29 01:27:32,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {118#true} 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; {120#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:32,202 INFO L280 TraceCheckUtils]: 2: Hoare triple {120#(= 0 ULTIMATE.start_main_~n~0)} assume !(main_~n~0 < 10); {119#false} is VALID [2020-07-29 01:27:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:32,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691443285] [2020-07-29 01:27:32,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:27:32,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:27:32,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969495579] [2020-07-29 01:27:32,208 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:32,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:32,209 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2020-07-29 01:27:32,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:32,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273412750] [2020-07-29 01:27:32,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:32,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:32,225 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:32,228 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:32,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:32,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:27:32,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:27:32,379 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:27:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:32,408 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:27:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:27:32,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:27:32,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:32,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2020-07-29 01:27:32,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:32,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2020-07-29 01:27:32,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:32,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:32,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-07-29 01:27:32,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:32,422 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 01:27:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-07-29 01:27:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-07-29 01:27:32,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:32,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 11 transitions. Second operand 8 states. [2020-07-29 01:27:32,423 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 11 transitions. Second operand 8 states. [2020-07-29 01:27:32,423 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 8 states. [2020-07-29 01:27:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:32,425 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:27:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:27:32,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:32,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:32,426 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states and 11 transitions. [2020-07-29 01:27:32,426 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states and 11 transitions. [2020-07-29 01:27:32,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:32,427 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:27:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:27:32,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:32,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:32,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:32,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:32,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:27:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-07-29 01:27:32,430 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:27:32,431 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:27:32,431 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:27:32,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-07-29 01:27:32,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:32,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:32,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:32,433 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:27:32,433 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:32,433 INFO L794 eck$LassoCheckResult]: Stem: 138#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 134#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; 135#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; 136#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 137#L13-3 assume !(main_~n~0 < 10); 133#L17-4 [2020-07-29 01:27:32,433 INFO L796 eck$LassoCheckResult]: Loop: 133#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 139#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; 132#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;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; 133#L17-4 [2020-07-29 01:27:32,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:32,434 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2020-07-29 01:27:32,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:32,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362222823] [2020-07-29 01:27:32,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:32,479 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {161#true} is VALID [2020-07-29 01:27:32,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} 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; {163#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:32,482 INFO L280 TraceCheckUtils]: 2: Hoare triple {163#(= 0 ULTIMATE.start_main_~n~0)} 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; {163#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:32,483 INFO L280 TraceCheckUtils]: 3: Hoare triple {163#(= 0 ULTIMATE.start_main_~n~0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {164#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:32,485 INFO L280 TraceCheckUtils]: 4: Hoare triple {164#(<= ULTIMATE.start_main_~n~0 1)} assume !(main_~n~0 < 10); {162#false} is VALID [2020-07-29 01:27:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:32,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362222823] [2020-07-29 01:27:32,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518469745] [2020-07-29 01:27:32,486 INFO L95 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 [2020-07-29 01:27:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:32,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:27:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:32,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:32,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {161#true} is VALID [2020-07-29 01:27:32,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} 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; {171#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:32,607 INFO L280 TraceCheckUtils]: 2: Hoare triple {171#(<= ULTIMATE.start_main_~n~0 0)} 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; {171#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:32,609 INFO L280 TraceCheckUtils]: 3: Hoare triple {171#(<= ULTIMATE.start_main_~n~0 0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {164#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:32,610 INFO L280 TraceCheckUtils]: 4: Hoare triple {164#(<= ULTIMATE.start_main_~n~0 1)} assume !(main_~n~0 < 10); {162#false} is VALID [2020-07-29 01:27:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:32,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:32,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2020-07-29 01:27:32,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386657138] [2020-07-29 01:27:32,612 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:32,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:32,613 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2020-07-29 01:27:32,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:32,613 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270483637] [2020-07-29 01:27:32,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:32,623 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:32,630 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:32,632 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:32,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:32,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:27:32,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:27:32,802 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-07-29 01:27:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:32,857 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:27:32,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:27:32,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:27:32,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:32,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2020-07-29 01:27:32,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:32,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2020-07-29 01:27:32,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:32,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:32,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2020-07-29 01:27:32,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:32,873 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 01:27:32,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2020-07-29 01:27:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-07-29 01:27:32,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:32,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:27:32,875 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:27:32,875 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:27:32,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:32,876 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:27:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:27:32,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:32,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:32,877 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 11 states and 13 transitions. [2020-07-29 01:27:32,877 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 11 states and 13 transitions. [2020-07-29 01:27:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:32,879 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:27:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:27:32,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:32,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:32,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:32,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:27:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2020-07-29 01:27:32,881 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-07-29 01:27:32,881 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-07-29 01:27:32,881 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:27:32,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-07-29 01:27:32,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:32,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:32,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:32,883 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-07-29 01:27:32,883 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:32,883 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 191#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; 192#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; 195#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 196#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; 197#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 200#L13-3 assume !(main_~n~0 < 10); 194#L17-4 [2020-07-29 01:27:32,884 INFO L796 eck$LassoCheckResult]: Loop: 194#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 199#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; 193#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;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; 194#L17-4 [2020-07-29 01:27:32,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:32,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2020-07-29 01:27:32,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:32,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57708726] [2020-07-29 01:27:32,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:32,940 INFO L280 TraceCheckUtils]: 0: Hoare triple {226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {226#true} is VALID [2020-07-29 01:27:32,941 INFO L280 TraceCheckUtils]: 1: Hoare triple {226#true} 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; {228#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:32,942 INFO L280 TraceCheckUtils]: 2: Hoare triple {228#(= 0 ULTIMATE.start_main_~n~0)} 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; {228#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:32,943 INFO L280 TraceCheckUtils]: 3: Hoare triple {228#(= 0 ULTIMATE.start_main_~n~0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {229#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:32,944 INFO L280 TraceCheckUtils]: 4: Hoare triple {229#(<= ULTIMATE.start_main_~n~0 1)} 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; {229#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:32,945 INFO L280 TraceCheckUtils]: 5: Hoare triple {229#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {230#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:32,946 INFO L280 TraceCheckUtils]: 6: Hoare triple {230#(<= ULTIMATE.start_main_~n~0 2)} assume !(main_~n~0 < 10); {227#false} is VALID [2020-07-29 01:27:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:32,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57708726] [2020-07-29 01:27:32,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249192511] [2020-07-29 01:27:32,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2020-07-29 01:27:32,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:27:32,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:32,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:32,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:33,056 INFO L280 TraceCheckUtils]: 0: Hoare triple {226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {226#true} is VALID [2020-07-29 01:27:33,058 INFO L280 TraceCheckUtils]: 1: Hoare triple {226#true} 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; {237#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:33,059 INFO L280 TraceCheckUtils]: 2: Hoare triple {237#(<= ULTIMATE.start_main_~n~0 0)} 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; {237#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:33,060 INFO L280 TraceCheckUtils]: 3: Hoare triple {237#(<= ULTIMATE.start_main_~n~0 0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {229#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:33,060 INFO L280 TraceCheckUtils]: 4: Hoare triple {229#(<= ULTIMATE.start_main_~n~0 1)} 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; {229#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:33,061 INFO L280 TraceCheckUtils]: 5: Hoare triple {229#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {230#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:33,062 INFO L280 TraceCheckUtils]: 6: Hoare triple {230#(<= ULTIMATE.start_main_~n~0 2)} assume !(main_~n~0 < 10); {227#false} is VALID [2020-07-29 01:27:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:33,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:33,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-29 01:27:33,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158947811] [2020-07-29 01:27:33,064 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:33,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:33,065 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2020-07-29 01:27:33,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:33,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094485485] [2020-07-29 01:27:33,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:33,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:33,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:33,079 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:33,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:33,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:27:33,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:27:33,192 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2020-07-29 01:27:33,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:33,253 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-07-29 01:27:33,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:27:33,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:27:33,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:33,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2020-07-29 01:27:33,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:33,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2020-07-29 01:27:33,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:33,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:33,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2020-07-29 01:27:33,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:33,273 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-07-29 01:27:33,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2020-07-29 01:27:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-07-29 01:27:33,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:33,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 15 transitions. Second operand 12 states. [2020-07-29 01:27:33,274 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 15 transitions. Second operand 12 states. [2020-07-29 01:27:33,274 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 12 states. [2020-07-29 01:27:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:33,276 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-07-29 01:27:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-07-29 01:27:33,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:33,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:33,277 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 13 states and 15 transitions. [2020-07-29 01:27:33,277 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 13 states and 15 transitions. [2020-07-29 01:27:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:33,278 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-07-29 01:27:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-07-29 01:27:33,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:33,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:33,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:33,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:27:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2020-07-29 01:27:33,281 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-07-29 01:27:33,281 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-07-29 01:27:33,281 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:27:33,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2020-07-29 01:27:33,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:33,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:33,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:33,283 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2020-07-29 01:27:33,283 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:33,283 INFO L794 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 267#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; 268#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; 269#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 270#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; 271#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 276#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; 275#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 274#L13-3 assume !(main_~n~0 < 10); 266#L17-4 [2020-07-29 01:27:33,283 INFO L796 eck$LassoCheckResult]: Loop: 266#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 273#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; 265#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;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; 266#L17-4 [2020-07-29 01:27:33,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:33,284 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2020-07-29 01:27:33,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:33,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702038361] [2020-07-29 01:27:33,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:33,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {306#true} is VALID [2020-07-29 01:27:33,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} 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; {308#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:33,357 INFO L280 TraceCheckUtils]: 2: Hoare triple {308#(= 0 ULTIMATE.start_main_~n~0)} 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; {308#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:33,358 INFO L280 TraceCheckUtils]: 3: Hoare triple {308#(= 0 ULTIMATE.start_main_~n~0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {309#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:33,359 INFO L280 TraceCheckUtils]: 4: Hoare triple {309#(<= ULTIMATE.start_main_~n~0 1)} 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; {309#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:33,360 INFO L280 TraceCheckUtils]: 5: Hoare triple {309#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {310#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:33,361 INFO L280 TraceCheckUtils]: 6: Hoare triple {310#(<= ULTIMATE.start_main_~n~0 2)} 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; {310#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:33,362 INFO L280 TraceCheckUtils]: 7: Hoare triple {310#(<= ULTIMATE.start_main_~n~0 2)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {311#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:33,363 INFO L280 TraceCheckUtils]: 8: Hoare triple {311#(<= ULTIMATE.start_main_~n~0 3)} assume !(main_~n~0 < 10); {307#false} is VALID [2020-07-29 01:27:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:33,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702038361] [2020-07-29 01:27:33,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629028546] [2020-07-29 01:27:33,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:27:33,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-29 01:27:33,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:33,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:27:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:33,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:33,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {306#true} is VALID [2020-07-29 01:27:33,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} 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; {318#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:33,530 INFO L280 TraceCheckUtils]: 2: Hoare triple {318#(<= ULTIMATE.start_main_~n~0 0)} 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; {318#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:33,531 INFO L280 TraceCheckUtils]: 3: Hoare triple {318#(<= ULTIMATE.start_main_~n~0 0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {309#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:33,532 INFO L280 TraceCheckUtils]: 4: Hoare triple {309#(<= ULTIMATE.start_main_~n~0 1)} 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; {309#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:33,533 INFO L280 TraceCheckUtils]: 5: Hoare triple {309#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {310#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:33,534 INFO L280 TraceCheckUtils]: 6: Hoare triple {310#(<= ULTIMATE.start_main_~n~0 2)} 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; {310#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:33,535 INFO L280 TraceCheckUtils]: 7: Hoare triple {310#(<= ULTIMATE.start_main_~n~0 2)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {311#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:33,536 INFO L280 TraceCheckUtils]: 8: Hoare triple {311#(<= ULTIMATE.start_main_~n~0 3)} assume !(main_~n~0 < 10); {307#false} is VALID [2020-07-29 01:27:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:33,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:33,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-29 01:27:33,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352583728] [2020-07-29 01:27:33,538 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:33,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:33,539 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2020-07-29 01:27:33,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:33,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183143866] [2020-07-29 01:27:33,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:33,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:33,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:33,569 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:33,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:33,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:27:33,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:27:33,684 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-07-29 01:27:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:33,751 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-29 01:27:33,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:27:33,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:27:33,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:33,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-07-29 01:27:33,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:33,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2020-07-29 01:27:33,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:33,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:33,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2020-07-29 01:27:33,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:33,769 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-29 01:27:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2020-07-29 01:27:33,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-07-29 01:27:33,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:33,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 17 transitions. Second operand 14 states. [2020-07-29 01:27:33,771 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 17 transitions. Second operand 14 states. [2020-07-29 01:27:33,771 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 14 states. [2020-07-29 01:27:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:33,772 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-29 01:27:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-29 01:27:33,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:33,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:33,773 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states and 17 transitions. [2020-07-29 01:27:33,773 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states and 17 transitions. [2020-07-29 01:27:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:33,774 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-29 01:27:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-29 01:27:33,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:33,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:33,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:33,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:27:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-07-29 01:27:33,776 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-07-29 01:27:33,776 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-07-29 01:27:33,776 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:27:33,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2020-07-29 01:27:33,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:33,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:33,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:33,778 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2020-07-29 01:27:33,778 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:33,778 INFO L794 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 356#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; 357#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; 358#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 359#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; 360#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 362#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; 367#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 366#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; 365#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 364#L13-3 assume !(main_~n~0 < 10); 355#L17-4 [2020-07-29 01:27:33,778 INFO L796 eck$LassoCheckResult]: Loop: 355#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 363#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; 354#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;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; 355#L17-4 [2020-07-29 01:27:33,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:33,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2020-07-29 01:27:33,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:33,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090602980] [2020-07-29 01:27:33,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:33,861 INFO L280 TraceCheckUtils]: 0: Hoare triple {401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {401#true} is VALID [2020-07-29 01:27:33,862 INFO L280 TraceCheckUtils]: 1: Hoare triple {401#true} 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; {403#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:33,863 INFO L280 TraceCheckUtils]: 2: Hoare triple {403#(= 0 ULTIMATE.start_main_~n~0)} 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; {403#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:33,864 INFO L280 TraceCheckUtils]: 3: Hoare triple {403#(= 0 ULTIMATE.start_main_~n~0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {404#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:33,864 INFO L280 TraceCheckUtils]: 4: Hoare triple {404#(<= ULTIMATE.start_main_~n~0 1)} 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; {404#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:33,865 INFO L280 TraceCheckUtils]: 5: Hoare triple {404#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {405#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:33,866 INFO L280 TraceCheckUtils]: 6: Hoare triple {405#(<= ULTIMATE.start_main_~n~0 2)} 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; {405#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:33,867 INFO L280 TraceCheckUtils]: 7: Hoare triple {405#(<= ULTIMATE.start_main_~n~0 2)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {406#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:33,868 INFO L280 TraceCheckUtils]: 8: Hoare triple {406#(<= ULTIMATE.start_main_~n~0 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; {406#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:33,869 INFO L280 TraceCheckUtils]: 9: Hoare triple {406#(<= ULTIMATE.start_main_~n~0 3)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {407#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:33,870 INFO L280 TraceCheckUtils]: 10: Hoare triple {407#(<= ULTIMATE.start_main_~n~0 4)} assume !(main_~n~0 < 10); {402#false} is VALID [2020-07-29 01:27:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:33,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090602980] [2020-07-29 01:27:33,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389491495] [2020-07-29 01:27:33,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:27:33,909 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 01:27:33,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:33,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:27:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:33,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:34,059 INFO L280 TraceCheckUtils]: 0: Hoare triple {401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {401#true} is VALID [2020-07-29 01:27:34,061 INFO L280 TraceCheckUtils]: 1: Hoare triple {401#true} 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; {414#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:34,062 INFO L280 TraceCheckUtils]: 2: Hoare triple {414#(<= ULTIMATE.start_main_~n~0 0)} 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#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:34,063 INFO L280 TraceCheckUtils]: 3: Hoare triple {414#(<= ULTIMATE.start_main_~n~0 0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {404#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:34,064 INFO L280 TraceCheckUtils]: 4: Hoare triple {404#(<= ULTIMATE.start_main_~n~0 1)} 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; {404#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:34,065 INFO L280 TraceCheckUtils]: 5: Hoare triple {404#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {405#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:34,066 INFO L280 TraceCheckUtils]: 6: Hoare triple {405#(<= ULTIMATE.start_main_~n~0 2)} 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; {405#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:34,067 INFO L280 TraceCheckUtils]: 7: Hoare triple {405#(<= ULTIMATE.start_main_~n~0 2)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {406#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:34,068 INFO L280 TraceCheckUtils]: 8: Hoare triple {406#(<= ULTIMATE.start_main_~n~0 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; {406#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:34,069 INFO L280 TraceCheckUtils]: 9: Hoare triple {406#(<= ULTIMATE.start_main_~n~0 3)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {407#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:34,070 INFO L280 TraceCheckUtils]: 10: Hoare triple {407#(<= ULTIMATE.start_main_~n~0 4)} assume !(main_~n~0 < 10); {402#false} is VALID [2020-07-29 01:27:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:34,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:34,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-29 01:27:34,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007101601] [2020-07-29 01:27:34,072 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:34,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:34,072 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2020-07-29 01:27:34,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:34,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970418999] [2020-07-29 01:27:34,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:34,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:34,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:34,086 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:34,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:34,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:27:34,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:27:34,210 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2020-07-29 01:27:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:34,328 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 01:27:34,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:27:34,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:27:34,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:34,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2020-07-29 01:27:34,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:34,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2020-07-29 01:27:34,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:34,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:34,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-07-29 01:27:34,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:34,363 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-29 01:27:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-07-29 01:27:34,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-07-29 01:27:34,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:34,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 19 transitions. Second operand 16 states. [2020-07-29 01:27:34,365 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 19 transitions. Second operand 16 states. [2020-07-29 01:27:34,365 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 16 states. [2020-07-29 01:27:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:34,367 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 01:27:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-29 01:27:34,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:34,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:34,367 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states and 19 transitions. [2020-07-29 01:27:34,368 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states and 19 transitions. [2020-07-29 01:27:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:34,369 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 01:27:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-29 01:27:34,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:34,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:34,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:34,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:34,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:27:34,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-29 01:27:34,371 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-29 01:27:34,371 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-29 01:27:34,371 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:27:34,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2020-07-29 01:27:34,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:34,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:34,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:34,373 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2020-07-29 01:27:34,373 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:34,373 INFO L794 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 460#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; 461#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; 462#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 463#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; 464#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 466#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; 473#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 472#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; 471#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 470#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; 469#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 468#L13-3 assume !(main_~n~0 < 10); 459#L17-4 [2020-07-29 01:27:34,373 INFO L796 eck$LassoCheckResult]: Loop: 459#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 467#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; 458#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;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; 459#L17-4 [2020-07-29 01:27:34,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:34,374 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2020-07-29 01:27:34,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:34,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910444164] [2020-07-29 01:27:34,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:34,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {511#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {511#true} is VALID [2020-07-29 01:27:34,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {511#true} 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; {513#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:34,481 INFO L280 TraceCheckUtils]: 2: Hoare triple {513#(= 0 ULTIMATE.start_main_~n~0)} 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; {513#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:34,482 INFO L280 TraceCheckUtils]: 3: Hoare triple {513#(= 0 ULTIMATE.start_main_~n~0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {514#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:34,483 INFO L280 TraceCheckUtils]: 4: Hoare triple {514#(<= ULTIMATE.start_main_~n~0 1)} 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; {514#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:34,484 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {515#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:34,485 INFO L280 TraceCheckUtils]: 6: Hoare triple {515#(<= ULTIMATE.start_main_~n~0 2)} 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#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:34,486 INFO L280 TraceCheckUtils]: 7: Hoare triple {515#(<= ULTIMATE.start_main_~n~0 2)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {516#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:34,486 INFO L280 TraceCheckUtils]: 8: Hoare triple {516#(<= ULTIMATE.start_main_~n~0 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; {516#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:34,487 INFO L280 TraceCheckUtils]: 9: Hoare triple {516#(<= ULTIMATE.start_main_~n~0 3)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {517#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:34,488 INFO L280 TraceCheckUtils]: 10: Hoare triple {517#(<= ULTIMATE.start_main_~n~0 4)} 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#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:34,489 INFO L280 TraceCheckUtils]: 11: Hoare triple {517#(<= ULTIMATE.start_main_~n~0 4)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {518#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:34,490 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#(<= ULTIMATE.start_main_~n~0 5)} assume !(main_~n~0 < 10); {512#false} is VALID [2020-07-29 01:27:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:34,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910444164] [2020-07-29 01:27:34,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736355507] [2020-07-29 01:27:34,491 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:27:34,548 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-29 01:27:34,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:34,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:34,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:34,720 INFO L280 TraceCheckUtils]: 0: Hoare triple {511#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {511#true} is VALID [2020-07-29 01:27:34,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {511#true} 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; {525#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:34,722 INFO L280 TraceCheckUtils]: 2: Hoare triple {525#(<= ULTIMATE.start_main_~n~0 0)} 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; {525#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:34,723 INFO L280 TraceCheckUtils]: 3: Hoare triple {525#(<= ULTIMATE.start_main_~n~0 0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {514#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:34,724 INFO L280 TraceCheckUtils]: 4: Hoare triple {514#(<= ULTIMATE.start_main_~n~0 1)} 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; {514#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:34,725 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {515#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:34,726 INFO L280 TraceCheckUtils]: 6: Hoare triple {515#(<= ULTIMATE.start_main_~n~0 2)} 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#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:34,727 INFO L280 TraceCheckUtils]: 7: Hoare triple {515#(<= ULTIMATE.start_main_~n~0 2)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {516#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:34,728 INFO L280 TraceCheckUtils]: 8: Hoare triple {516#(<= ULTIMATE.start_main_~n~0 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; {516#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:34,729 INFO L280 TraceCheckUtils]: 9: Hoare triple {516#(<= ULTIMATE.start_main_~n~0 3)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {517#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:34,730 INFO L280 TraceCheckUtils]: 10: Hoare triple {517#(<= ULTIMATE.start_main_~n~0 4)} 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#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:34,731 INFO L280 TraceCheckUtils]: 11: Hoare triple {517#(<= ULTIMATE.start_main_~n~0 4)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {518#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:34,732 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#(<= ULTIMATE.start_main_~n~0 5)} assume !(main_~n~0 < 10); {512#false} is VALID [2020-07-29 01:27:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:34,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:34,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-29 01:27:34,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199995391] [2020-07-29 01:27:34,734 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:34,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:34,734 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2020-07-29 01:27:34,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:34,735 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467846609] [2020-07-29 01:27:34,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:34,740 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:34,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:34,745 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:34,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:34,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:27:34,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:27:34,859 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2020-07-29 01:27:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:34,980 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-29 01:27:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:27:34,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:27:35,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:35,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2020-07-29 01:27:35,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:35,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2020-07-29 01:27:35,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:35,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:35,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2020-07-29 01:27:35,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:35,009 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-29 01:27:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2020-07-29 01:27:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-07-29 01:27:35,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:35,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 21 transitions. Second operand 18 states. [2020-07-29 01:27:35,015 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 21 transitions. Second operand 18 states. [2020-07-29 01:27:35,015 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 18 states. [2020-07-29 01:27:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:35,016 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-29 01:27:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-29 01:27:35,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:35,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:35,018 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 19 states and 21 transitions. [2020-07-29 01:27:35,018 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 19 states and 21 transitions. [2020-07-29 01:27:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:35,020 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-29 01:27:35,020 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-29 01:27:35,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:35,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:35,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:35,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:27:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-29 01:27:35,026 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-29 01:27:35,026 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-29 01:27:35,026 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:27:35,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-07-29 01:27:35,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:35,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:35,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:35,028 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2020-07-29 01:27:35,028 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:35,028 INFO L794 eck$LassoCheckResult]: Stem: 584#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 579#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; 580#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; 581#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 582#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; 583#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 585#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; 594#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 593#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; 592#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 591#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; 590#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 589#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; 588#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 587#L13-3 assume !(main_~n~0 < 10); 578#L17-4 [2020-07-29 01:27:35,028 INFO L796 eck$LassoCheckResult]: Loop: 578#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 586#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; 577#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;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; 578#L17-4 [2020-07-29 01:27:35,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:35,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2020-07-29 01:27:35,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:35,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114542034] [2020-07-29 01:27:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:35,134 INFO L280 TraceCheckUtils]: 0: Hoare triple {636#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {636#true} is VALID [2020-07-29 01:27:35,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {636#true} 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; {638#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:35,136 INFO L280 TraceCheckUtils]: 2: Hoare triple {638#(= 0 ULTIMATE.start_main_~n~0)} 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; {638#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:35,137 INFO L280 TraceCheckUtils]: 3: Hoare triple {638#(= 0 ULTIMATE.start_main_~n~0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {639#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:35,138 INFO L280 TraceCheckUtils]: 4: Hoare triple {639#(<= ULTIMATE.start_main_~n~0 1)} 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; {639#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:35,139 INFO L280 TraceCheckUtils]: 5: Hoare triple {639#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {640#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:35,140 INFO L280 TraceCheckUtils]: 6: Hoare triple {640#(<= ULTIMATE.start_main_~n~0 2)} 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; {640#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:35,141 INFO L280 TraceCheckUtils]: 7: Hoare triple {640#(<= ULTIMATE.start_main_~n~0 2)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {641#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:35,142 INFO L280 TraceCheckUtils]: 8: Hoare triple {641#(<= ULTIMATE.start_main_~n~0 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; {641#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:35,143 INFO L280 TraceCheckUtils]: 9: Hoare triple {641#(<= ULTIMATE.start_main_~n~0 3)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {642#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:35,147 INFO L280 TraceCheckUtils]: 10: Hoare triple {642#(<= ULTIMATE.start_main_~n~0 4)} 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; {642#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:35,149 INFO L280 TraceCheckUtils]: 11: Hoare triple {642#(<= ULTIMATE.start_main_~n~0 4)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {643#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:35,150 INFO L280 TraceCheckUtils]: 12: Hoare triple {643#(<= ULTIMATE.start_main_~n~0 5)} 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; {643#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:35,151 INFO L280 TraceCheckUtils]: 13: Hoare triple {643#(<= ULTIMATE.start_main_~n~0 5)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {644#(<= ULTIMATE.start_main_~n~0 6)} is VALID [2020-07-29 01:27:35,152 INFO L280 TraceCheckUtils]: 14: Hoare triple {644#(<= ULTIMATE.start_main_~n~0 6)} assume !(main_~n~0 < 10); {637#false} is VALID [2020-07-29 01:27:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:35,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114542034] [2020-07-29 01:27:35,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72374884] [2020-07-29 01:27:35,153 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:27:35,206 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-29 01:27:35,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:35,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:27:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:35,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:35,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {636#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {636#true} is VALID [2020-07-29 01:27:35,449 INFO L280 TraceCheckUtils]: 1: Hoare triple {636#true} 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; {651#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:35,456 INFO L280 TraceCheckUtils]: 2: Hoare triple {651#(<= ULTIMATE.start_main_~n~0 0)} 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; {651#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:35,458 INFO L280 TraceCheckUtils]: 3: Hoare triple {651#(<= ULTIMATE.start_main_~n~0 0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {639#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:35,458 INFO L280 TraceCheckUtils]: 4: Hoare triple {639#(<= ULTIMATE.start_main_~n~0 1)} 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; {639#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:35,459 INFO L280 TraceCheckUtils]: 5: Hoare triple {639#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {640#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:35,460 INFO L280 TraceCheckUtils]: 6: Hoare triple {640#(<= ULTIMATE.start_main_~n~0 2)} 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; {640#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:35,461 INFO L280 TraceCheckUtils]: 7: Hoare triple {640#(<= ULTIMATE.start_main_~n~0 2)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {641#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:35,476 INFO L280 TraceCheckUtils]: 8: Hoare triple {641#(<= ULTIMATE.start_main_~n~0 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; {641#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:35,478 INFO L280 TraceCheckUtils]: 9: Hoare triple {641#(<= ULTIMATE.start_main_~n~0 3)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {642#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:35,478 INFO L280 TraceCheckUtils]: 10: Hoare triple {642#(<= ULTIMATE.start_main_~n~0 4)} 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; {642#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:35,480 INFO L280 TraceCheckUtils]: 11: Hoare triple {642#(<= ULTIMATE.start_main_~n~0 4)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {643#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:35,481 INFO L280 TraceCheckUtils]: 12: Hoare triple {643#(<= ULTIMATE.start_main_~n~0 5)} 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; {643#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:35,482 INFO L280 TraceCheckUtils]: 13: Hoare triple {643#(<= ULTIMATE.start_main_~n~0 5)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {644#(<= ULTIMATE.start_main_~n~0 6)} is VALID [2020-07-29 01:27:35,483 INFO L280 TraceCheckUtils]: 14: Hoare triple {644#(<= ULTIMATE.start_main_~n~0 6)} assume !(main_~n~0 < 10); {637#false} is VALID [2020-07-29 01:27:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:35,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:35,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-07-29 01:27:35,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964638096] [2020-07-29 01:27:35,486 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:35,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:35,487 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2020-07-29 01:27:35,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:35,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922300147] [2020-07-29 01:27:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:35,498 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:35,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:35,511 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:35,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:35,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:27:35,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:27:35,628 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2020-07-29 01:27:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:35,758 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-29 01:27:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:27:35,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:27:35,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:35,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2020-07-29 01:27:35,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:35,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2020-07-29 01:27:35,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:35,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:35,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2020-07-29 01:27:35,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:35,790 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-29 01:27:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2020-07-29 01:27:35,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-29 01:27:35,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:35,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 23 transitions. Second operand 20 states. [2020-07-29 01:27:35,792 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 23 transitions. Second operand 20 states. [2020-07-29 01:27:35,792 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 20 states. [2020-07-29 01:27:35,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:35,796 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-29 01:27:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-29 01:27:35,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:35,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:35,797 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states and 23 transitions. [2020-07-29 01:27:35,797 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states and 23 transitions. [2020-07-29 01:27:35,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:35,801 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-29 01:27:35,801 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-29 01:27:35,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:35,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:35,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:35,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:27:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-07-29 01:27:35,802 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-29 01:27:35,802 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-29 01:27:35,802 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:27:35,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2020-07-29 01:27:35,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:35,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:35,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:35,803 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2020-07-29 01:27:35,803 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:35,803 INFO L794 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 713#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; 714#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; 715#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 716#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; 717#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 719#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; 730#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 729#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; 728#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 727#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; 726#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 725#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; 724#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 723#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; 722#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 721#L13-3 assume !(main_~n~0 < 10); 712#L17-4 [2020-07-29 01:27:35,804 INFO L796 eck$LassoCheckResult]: Loop: 712#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 720#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; 711#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;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; 712#L17-4 [2020-07-29 01:27:35,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:35,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2020-07-29 01:27:35,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:35,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005360538] [2020-07-29 01:27:35,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:35,923 INFO L280 TraceCheckUtils]: 0: Hoare triple {776#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {776#true} is VALID [2020-07-29 01:27:35,924 INFO L280 TraceCheckUtils]: 1: Hoare triple {776#true} 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; {778#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:35,925 INFO L280 TraceCheckUtils]: 2: Hoare triple {778#(= 0 ULTIMATE.start_main_~n~0)} 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; {778#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:35,926 INFO L280 TraceCheckUtils]: 3: Hoare triple {778#(= 0 ULTIMATE.start_main_~n~0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {779#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:35,927 INFO L280 TraceCheckUtils]: 4: Hoare triple {779#(<= ULTIMATE.start_main_~n~0 1)} 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; {779#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:35,928 INFO L280 TraceCheckUtils]: 5: Hoare triple {779#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {780#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:35,929 INFO L280 TraceCheckUtils]: 6: Hoare triple {780#(<= ULTIMATE.start_main_~n~0 2)} 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; {780#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:35,930 INFO L280 TraceCheckUtils]: 7: Hoare triple {780#(<= ULTIMATE.start_main_~n~0 2)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {781#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:35,930 INFO L280 TraceCheckUtils]: 8: Hoare triple {781#(<= ULTIMATE.start_main_~n~0 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; {781#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:35,931 INFO L280 TraceCheckUtils]: 9: Hoare triple {781#(<= ULTIMATE.start_main_~n~0 3)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {782#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:35,932 INFO L280 TraceCheckUtils]: 10: Hoare triple {782#(<= ULTIMATE.start_main_~n~0 4)} 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; {782#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:35,933 INFO L280 TraceCheckUtils]: 11: Hoare triple {782#(<= ULTIMATE.start_main_~n~0 4)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {783#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:35,934 INFO L280 TraceCheckUtils]: 12: Hoare triple {783#(<= ULTIMATE.start_main_~n~0 5)} 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; {783#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:35,935 INFO L280 TraceCheckUtils]: 13: Hoare triple {783#(<= ULTIMATE.start_main_~n~0 5)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {784#(<= ULTIMATE.start_main_~n~0 6)} is VALID [2020-07-29 01:27:35,936 INFO L280 TraceCheckUtils]: 14: Hoare triple {784#(<= ULTIMATE.start_main_~n~0 6)} 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; {784#(<= ULTIMATE.start_main_~n~0 6)} is VALID [2020-07-29 01:27:35,937 INFO L280 TraceCheckUtils]: 15: Hoare triple {784#(<= ULTIMATE.start_main_~n~0 6)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {785#(<= ULTIMATE.start_main_~n~0 7)} is VALID [2020-07-29 01:27:35,938 INFO L280 TraceCheckUtils]: 16: Hoare triple {785#(<= ULTIMATE.start_main_~n~0 7)} assume !(main_~n~0 < 10); {777#false} is VALID [2020-07-29 01:27:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:35,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005360538] [2020-07-29 01:27:35,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9131951] [2020-07-29 01:27:35,939 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:27:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:35,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:27:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:35,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:36,206 INFO L280 TraceCheckUtils]: 0: Hoare triple {776#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {776#true} is VALID [2020-07-29 01:27:36,207 INFO L280 TraceCheckUtils]: 1: Hoare triple {776#true} 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; {792#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:36,208 INFO L280 TraceCheckUtils]: 2: Hoare triple {792#(<= ULTIMATE.start_main_~n~0 0)} 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; {792#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:36,209 INFO L280 TraceCheckUtils]: 3: Hoare triple {792#(<= ULTIMATE.start_main_~n~0 0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {779#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:36,210 INFO L280 TraceCheckUtils]: 4: Hoare triple {779#(<= ULTIMATE.start_main_~n~0 1)} 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; {779#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:36,211 INFO L280 TraceCheckUtils]: 5: Hoare triple {779#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {780#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:36,212 INFO L280 TraceCheckUtils]: 6: Hoare triple {780#(<= ULTIMATE.start_main_~n~0 2)} 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; {780#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:36,213 INFO L280 TraceCheckUtils]: 7: Hoare triple {780#(<= ULTIMATE.start_main_~n~0 2)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {781#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:36,214 INFO L280 TraceCheckUtils]: 8: Hoare triple {781#(<= ULTIMATE.start_main_~n~0 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; {781#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:36,214 INFO L280 TraceCheckUtils]: 9: Hoare triple {781#(<= ULTIMATE.start_main_~n~0 3)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {782#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:36,215 INFO L280 TraceCheckUtils]: 10: Hoare triple {782#(<= ULTIMATE.start_main_~n~0 4)} 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; {782#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:36,216 INFO L280 TraceCheckUtils]: 11: Hoare triple {782#(<= ULTIMATE.start_main_~n~0 4)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {783#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:36,217 INFO L280 TraceCheckUtils]: 12: Hoare triple {783#(<= ULTIMATE.start_main_~n~0 5)} 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; {783#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:36,218 INFO L280 TraceCheckUtils]: 13: Hoare triple {783#(<= ULTIMATE.start_main_~n~0 5)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {784#(<= ULTIMATE.start_main_~n~0 6)} is VALID [2020-07-29 01:27:36,219 INFO L280 TraceCheckUtils]: 14: Hoare triple {784#(<= ULTIMATE.start_main_~n~0 6)} 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; {784#(<= ULTIMATE.start_main_~n~0 6)} is VALID [2020-07-29 01:27:36,220 INFO L280 TraceCheckUtils]: 15: Hoare triple {784#(<= ULTIMATE.start_main_~n~0 6)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {785#(<= ULTIMATE.start_main_~n~0 7)} is VALID [2020-07-29 01:27:36,221 INFO L280 TraceCheckUtils]: 16: Hoare triple {785#(<= ULTIMATE.start_main_~n~0 7)} assume !(main_~n~0 < 10); {777#false} is VALID [2020-07-29 01:27:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:36,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:36,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-07-29 01:27:36,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010932090] [2020-07-29 01:27:36,222 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:36,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:36,223 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2020-07-29 01:27:36,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:36,223 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310311245] [2020-07-29 01:27:36,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:36,228 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:36,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:36,233 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:36,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:36,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:27:36,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:27:36,341 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2020-07-29 01:27:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:36,412 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-29 01:27:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:27:36,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:27:36,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:36,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2020-07-29 01:27:36,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:36,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2020-07-29 01:27:36,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:36,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:36,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2020-07-29 01:27:36,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:36,451 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-29 01:27:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2020-07-29 01:27:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-29 01:27:36,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:36,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 25 transitions. Second operand 22 states. [2020-07-29 01:27:36,453 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 25 transitions. Second operand 22 states. [2020-07-29 01:27:36,453 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 22 states. [2020-07-29 01:27:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:36,454 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-29 01:27:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-29 01:27:36,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:36,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:36,455 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states and 25 transitions. [2020-07-29 01:27:36,455 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states and 25 transitions. [2020-07-29 01:27:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:36,456 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-29 01:27:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-29 01:27:36,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:36,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:36,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:36,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:27:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-29 01:27:36,457 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-29 01:27:36,458 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-29 01:27:36,458 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 01:27:36,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2020-07-29 01:27:36,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:36,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:36,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:36,459 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2020-07-29 01:27:36,459 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:36,459 INFO L794 eck$LassoCheckResult]: Stem: 867#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 860#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; 861#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; 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; 866#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 868#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; 881#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 880#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; 879#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 878#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; 877#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 876#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; 875#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 874#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; 873#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 872#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; 871#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 870#L13-3 assume !(main_~n~0 < 10); 863#L17-4 [2020-07-29 01:27:36,459 INFO L796 eck$LassoCheckResult]: Loop: 863#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 869#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; 862#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;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; 863#L17-4 [2020-07-29 01:27:36,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:36,460 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2020-07-29 01:27:36,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:36,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753830460] [2020-07-29 01:27:36,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:36,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {931#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {931#true} is VALID [2020-07-29 01:27:36,620 INFO L280 TraceCheckUtils]: 1: Hoare triple {931#true} 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; {933#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:36,621 INFO L280 TraceCheckUtils]: 2: Hoare triple {933#(= 0 ULTIMATE.start_main_~n~0)} 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; {933#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:36,621 INFO L280 TraceCheckUtils]: 3: Hoare triple {933#(= 0 ULTIMATE.start_main_~n~0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {934#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:36,622 INFO L280 TraceCheckUtils]: 4: Hoare triple {934#(<= ULTIMATE.start_main_~n~0 1)} 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; {934#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:36,623 INFO L280 TraceCheckUtils]: 5: Hoare triple {934#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {935#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:36,624 INFO L280 TraceCheckUtils]: 6: Hoare triple {935#(<= ULTIMATE.start_main_~n~0 2)} 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; {935#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:36,624 INFO L280 TraceCheckUtils]: 7: Hoare triple {935#(<= ULTIMATE.start_main_~n~0 2)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {936#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:36,625 INFO L280 TraceCheckUtils]: 8: Hoare triple {936#(<= ULTIMATE.start_main_~n~0 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; {936#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:36,626 INFO L280 TraceCheckUtils]: 9: Hoare triple {936#(<= ULTIMATE.start_main_~n~0 3)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {937#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:36,626 INFO L280 TraceCheckUtils]: 10: Hoare triple {937#(<= ULTIMATE.start_main_~n~0 4)} 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; {937#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:36,627 INFO L280 TraceCheckUtils]: 11: Hoare triple {937#(<= ULTIMATE.start_main_~n~0 4)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {938#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:36,628 INFO L280 TraceCheckUtils]: 12: Hoare triple {938#(<= ULTIMATE.start_main_~n~0 5)} 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; {938#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:36,628 INFO L280 TraceCheckUtils]: 13: Hoare triple {938#(<= ULTIMATE.start_main_~n~0 5)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {939#(<= ULTIMATE.start_main_~n~0 6)} is VALID [2020-07-29 01:27:36,629 INFO L280 TraceCheckUtils]: 14: Hoare triple {939#(<= ULTIMATE.start_main_~n~0 6)} 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; {939#(<= ULTIMATE.start_main_~n~0 6)} is VALID [2020-07-29 01:27:36,630 INFO L280 TraceCheckUtils]: 15: Hoare triple {939#(<= ULTIMATE.start_main_~n~0 6)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {940#(<= ULTIMATE.start_main_~n~0 7)} is VALID [2020-07-29 01:27:36,630 INFO L280 TraceCheckUtils]: 16: Hoare triple {940#(<= ULTIMATE.start_main_~n~0 7)} 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; {940#(<= ULTIMATE.start_main_~n~0 7)} is VALID [2020-07-29 01:27:36,631 INFO L280 TraceCheckUtils]: 17: Hoare triple {940#(<= ULTIMATE.start_main_~n~0 7)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {941#(<= ULTIMATE.start_main_~n~0 8)} is VALID [2020-07-29 01:27:36,632 INFO L280 TraceCheckUtils]: 18: Hoare triple {941#(<= ULTIMATE.start_main_~n~0 8)} assume !(main_~n~0 < 10); {932#false} is VALID [2020-07-29 01:27:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:36,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753830460] [2020-07-29 01:27:36,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264276020] [2020-07-29 01:27:36,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:27:36,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:27:36,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:36,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:27:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:36,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:36,919 INFO L280 TraceCheckUtils]: 0: Hoare triple {931#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {931#true} is VALID [2020-07-29 01:27:36,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {931#true} 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; {948#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:36,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {948#(<= ULTIMATE.start_main_~n~0 0)} 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; {948#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:36,929 INFO L280 TraceCheckUtils]: 3: Hoare triple {948#(<= ULTIMATE.start_main_~n~0 0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {934#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:36,929 INFO L280 TraceCheckUtils]: 4: Hoare triple {934#(<= ULTIMATE.start_main_~n~0 1)} 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; {934#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:36,930 INFO L280 TraceCheckUtils]: 5: Hoare triple {934#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {935#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:36,931 INFO L280 TraceCheckUtils]: 6: Hoare triple {935#(<= ULTIMATE.start_main_~n~0 2)} 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; {935#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:36,932 INFO L280 TraceCheckUtils]: 7: Hoare triple {935#(<= ULTIMATE.start_main_~n~0 2)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {936#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:36,932 INFO L280 TraceCheckUtils]: 8: Hoare triple {936#(<= ULTIMATE.start_main_~n~0 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; {936#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:36,933 INFO L280 TraceCheckUtils]: 9: Hoare triple {936#(<= ULTIMATE.start_main_~n~0 3)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {937#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:36,933 INFO L280 TraceCheckUtils]: 10: Hoare triple {937#(<= ULTIMATE.start_main_~n~0 4)} 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; {937#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:36,934 INFO L280 TraceCheckUtils]: 11: Hoare triple {937#(<= ULTIMATE.start_main_~n~0 4)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {938#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:36,935 INFO L280 TraceCheckUtils]: 12: Hoare triple {938#(<= ULTIMATE.start_main_~n~0 5)} 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; {938#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:36,935 INFO L280 TraceCheckUtils]: 13: Hoare triple {938#(<= ULTIMATE.start_main_~n~0 5)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {939#(<= ULTIMATE.start_main_~n~0 6)} is VALID [2020-07-29 01:27:36,936 INFO L280 TraceCheckUtils]: 14: Hoare triple {939#(<= ULTIMATE.start_main_~n~0 6)} 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; {939#(<= ULTIMATE.start_main_~n~0 6)} is VALID [2020-07-29 01:27:36,936 INFO L280 TraceCheckUtils]: 15: Hoare triple {939#(<= ULTIMATE.start_main_~n~0 6)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {940#(<= ULTIMATE.start_main_~n~0 7)} is VALID [2020-07-29 01:27:36,937 INFO L280 TraceCheckUtils]: 16: Hoare triple {940#(<= ULTIMATE.start_main_~n~0 7)} 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; {940#(<= ULTIMATE.start_main_~n~0 7)} is VALID [2020-07-29 01:27:36,938 INFO L280 TraceCheckUtils]: 17: Hoare triple {940#(<= ULTIMATE.start_main_~n~0 7)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {941#(<= ULTIMATE.start_main_~n~0 8)} is VALID [2020-07-29 01:27:36,939 INFO L280 TraceCheckUtils]: 18: Hoare triple {941#(<= ULTIMATE.start_main_~n~0 8)} assume !(main_~n~0 < 10); {932#false} is VALID [2020-07-29 01:27:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:36,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:36,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-07-29 01:27:36,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118777617] [2020-07-29 01:27:36,941 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:36,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:36,941 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2020-07-29 01:27:36,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:36,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939526703] [2020-07-29 01:27:36,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:36,945 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:36,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:36,949 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:37,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:37,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:27:37,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:27:37,071 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2020-07-29 01:27:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:37,214 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-29 01:27:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:27:37,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:27:37,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:37,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2020-07-29 01:27:37,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:37,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2020-07-29 01:27:37,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:37,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:37,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2020-07-29 01:27:37,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:37,251 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-29 01:27:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2020-07-29 01:27:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-07-29 01:27:37,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:37,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 27 transitions. Second operand 24 states. [2020-07-29 01:27:37,253 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 27 transitions. Second operand 24 states. [2020-07-29 01:27:37,254 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 24 states. [2020-07-29 01:27:37,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:37,254 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-29 01:27:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-29 01:27:37,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:37,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:37,255 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states and 27 transitions. [2020-07-29 01:27:37,255 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states and 27 transitions. [2020-07-29 01:27:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:37,256 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-29 01:27:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-29 01:27:37,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:37,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:37,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:37,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:27:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-29 01:27:37,258 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-29 01:27:37,258 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-29 01:27:37,258 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 01:27:37,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2020-07-29 01:27:37,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:37,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:37,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:37,260 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2020-07-29 01:27:37,260 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:37,260 INFO L794 eck$LassoCheckResult]: Stem: 1031#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1024#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; 1025#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; 1028#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1029#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; 1030#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1032#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; 1047#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1046#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; 1045#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1044#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; 1043#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1042#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; 1041#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1040#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; 1039#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1038#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; 1037#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1036#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; 1035#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1034#L13-3 assume !(main_~n~0 < 10); 1027#L17-4 [2020-07-29 01:27:37,260 INFO L796 eck$LassoCheckResult]: Loop: 1027#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 1033#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; 1026#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;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; 1027#L17-4 [2020-07-29 01:27:37,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:37,260 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2020-07-29 01:27:37,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:37,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952158705] [2020-07-29 01:27:37,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:37,438 INFO L280 TraceCheckUtils]: 0: Hoare triple {1101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1101#true} is VALID [2020-07-29 01:27:37,439 INFO L280 TraceCheckUtils]: 1: Hoare triple {1101#true} 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; {1103#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:37,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {1103#(= 0 ULTIMATE.start_main_~n~0)} 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; {1103#(= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 01:27:37,441 INFO L280 TraceCheckUtils]: 3: Hoare triple {1103#(= 0 ULTIMATE.start_main_~n~0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1104#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:37,441 INFO L280 TraceCheckUtils]: 4: Hoare triple {1104#(<= ULTIMATE.start_main_~n~0 1)} 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; {1104#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:37,442 INFO L280 TraceCheckUtils]: 5: Hoare triple {1104#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1105#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:37,448 INFO L280 TraceCheckUtils]: 6: Hoare triple {1105#(<= ULTIMATE.start_main_~n~0 2)} 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; {1105#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:37,448 INFO L280 TraceCheckUtils]: 7: Hoare triple {1105#(<= ULTIMATE.start_main_~n~0 2)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1106#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:37,449 INFO L280 TraceCheckUtils]: 8: Hoare triple {1106#(<= ULTIMATE.start_main_~n~0 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; {1106#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:37,450 INFO L280 TraceCheckUtils]: 9: Hoare triple {1106#(<= ULTIMATE.start_main_~n~0 3)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1107#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:37,450 INFO L280 TraceCheckUtils]: 10: Hoare triple {1107#(<= ULTIMATE.start_main_~n~0 4)} 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; {1107#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:37,451 INFO L280 TraceCheckUtils]: 11: Hoare triple {1107#(<= ULTIMATE.start_main_~n~0 4)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1108#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:37,451 INFO L280 TraceCheckUtils]: 12: Hoare triple {1108#(<= ULTIMATE.start_main_~n~0 5)} 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; {1108#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:37,452 INFO L280 TraceCheckUtils]: 13: Hoare triple {1108#(<= ULTIMATE.start_main_~n~0 5)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1109#(<= ULTIMATE.start_main_~n~0 6)} is VALID [2020-07-29 01:27:37,452 INFO L280 TraceCheckUtils]: 14: Hoare triple {1109#(<= ULTIMATE.start_main_~n~0 6)} 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; {1109#(<= ULTIMATE.start_main_~n~0 6)} is VALID [2020-07-29 01:27:37,458 INFO L280 TraceCheckUtils]: 15: Hoare triple {1109#(<= ULTIMATE.start_main_~n~0 6)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1110#(<= ULTIMATE.start_main_~n~0 7)} is VALID [2020-07-29 01:27:37,459 INFO L280 TraceCheckUtils]: 16: Hoare triple {1110#(<= ULTIMATE.start_main_~n~0 7)} 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; {1110#(<= ULTIMATE.start_main_~n~0 7)} is VALID [2020-07-29 01:27:37,459 INFO L280 TraceCheckUtils]: 17: Hoare triple {1110#(<= ULTIMATE.start_main_~n~0 7)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1111#(<= ULTIMATE.start_main_~n~0 8)} is VALID [2020-07-29 01:27:37,460 INFO L280 TraceCheckUtils]: 18: Hoare triple {1111#(<= ULTIMATE.start_main_~n~0 8)} 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; {1111#(<= ULTIMATE.start_main_~n~0 8)} is VALID [2020-07-29 01:27:37,461 INFO L280 TraceCheckUtils]: 19: Hoare triple {1111#(<= ULTIMATE.start_main_~n~0 8)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1112#(<= ULTIMATE.start_main_~n~0 9)} is VALID [2020-07-29 01:27:37,461 INFO L280 TraceCheckUtils]: 20: Hoare triple {1112#(<= ULTIMATE.start_main_~n~0 9)} assume !(main_~n~0 < 10); {1102#false} is VALID [2020-07-29 01:27:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:37,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952158705] [2020-07-29 01:27:37,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759008281] [2020-07-29 01:27:37,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:27:37,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-07-29 01:27:37,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:37,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:27:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:37,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:37,824 INFO L280 TraceCheckUtils]: 0: Hoare triple {1101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1101#true} is VALID [2020-07-29 01:27:37,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {1101#true} 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; {1119#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:37,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {1119#(<= ULTIMATE.start_main_~n~0 0)} 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; {1119#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 01:27:37,827 INFO L280 TraceCheckUtils]: 3: Hoare triple {1119#(<= ULTIMATE.start_main_~n~0 0)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1104#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:37,828 INFO L280 TraceCheckUtils]: 4: Hoare triple {1104#(<= ULTIMATE.start_main_~n~0 1)} 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; {1104#(<= ULTIMATE.start_main_~n~0 1)} is VALID [2020-07-29 01:27:37,829 INFO L280 TraceCheckUtils]: 5: Hoare triple {1104#(<= ULTIMATE.start_main_~n~0 1)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1105#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:37,830 INFO L280 TraceCheckUtils]: 6: Hoare triple {1105#(<= ULTIMATE.start_main_~n~0 2)} 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; {1105#(<= ULTIMATE.start_main_~n~0 2)} is VALID [2020-07-29 01:27:37,831 INFO L280 TraceCheckUtils]: 7: Hoare triple {1105#(<= ULTIMATE.start_main_~n~0 2)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1106#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:37,831 INFO L280 TraceCheckUtils]: 8: Hoare triple {1106#(<= ULTIMATE.start_main_~n~0 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; {1106#(<= ULTIMATE.start_main_~n~0 3)} is VALID [2020-07-29 01:27:37,832 INFO L280 TraceCheckUtils]: 9: Hoare triple {1106#(<= ULTIMATE.start_main_~n~0 3)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1107#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:37,832 INFO L280 TraceCheckUtils]: 10: Hoare triple {1107#(<= ULTIMATE.start_main_~n~0 4)} 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; {1107#(<= ULTIMATE.start_main_~n~0 4)} is VALID [2020-07-29 01:27:37,833 INFO L280 TraceCheckUtils]: 11: Hoare triple {1107#(<= ULTIMATE.start_main_~n~0 4)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1108#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:37,833 INFO L280 TraceCheckUtils]: 12: Hoare triple {1108#(<= ULTIMATE.start_main_~n~0 5)} 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; {1108#(<= ULTIMATE.start_main_~n~0 5)} is VALID [2020-07-29 01:27:37,834 INFO L280 TraceCheckUtils]: 13: Hoare triple {1108#(<= ULTIMATE.start_main_~n~0 5)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1109#(<= ULTIMATE.start_main_~n~0 6)} is VALID [2020-07-29 01:27:37,834 INFO L280 TraceCheckUtils]: 14: Hoare triple {1109#(<= ULTIMATE.start_main_~n~0 6)} 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; {1109#(<= ULTIMATE.start_main_~n~0 6)} is VALID [2020-07-29 01:27:37,835 INFO L280 TraceCheckUtils]: 15: Hoare triple {1109#(<= ULTIMATE.start_main_~n~0 6)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1110#(<= ULTIMATE.start_main_~n~0 7)} is VALID [2020-07-29 01:27:37,835 INFO L280 TraceCheckUtils]: 16: Hoare triple {1110#(<= ULTIMATE.start_main_~n~0 7)} 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; {1110#(<= ULTIMATE.start_main_~n~0 7)} is VALID [2020-07-29 01:27:37,836 INFO L280 TraceCheckUtils]: 17: Hoare triple {1110#(<= ULTIMATE.start_main_~n~0 7)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1111#(<= ULTIMATE.start_main_~n~0 8)} is VALID [2020-07-29 01:27:37,836 INFO L280 TraceCheckUtils]: 18: Hoare triple {1111#(<= ULTIMATE.start_main_~n~0 8)} 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; {1111#(<= ULTIMATE.start_main_~n~0 8)} is VALID [2020-07-29 01:27:37,837 INFO L280 TraceCheckUtils]: 19: Hoare triple {1111#(<= ULTIMATE.start_main_~n~0 8)} main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; {1112#(<= ULTIMATE.start_main_~n~0 9)} is VALID [2020-07-29 01:27:37,837 INFO L280 TraceCheckUtils]: 20: Hoare triple {1112#(<= ULTIMATE.start_main_~n~0 9)} assume !(main_~n~0 < 10); {1102#false} is VALID [2020-07-29 01:27:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:37,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:37,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-07-29 01:27:37,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433869183] [2020-07-29 01:27:37,839 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:37,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:37,839 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2020-07-29 01:27:37,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:37,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341701460] [2020-07-29 01:27:37,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:37,844 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:37,847 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:37,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:37,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:27:37,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:27:37,955 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2020-07-29 01:27:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:38,093 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-29 01:27:38,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-29 01:27:38,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:27:38,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:38,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-07-29 01:27:38,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:38,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2020-07-29 01:27:38,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:38,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:38,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2020-07-29 01:27:38,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:38,140 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-07-29 01:27:38,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2020-07-29 01:27:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-29 01:27:38,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:38,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 28 transitions. Second operand 26 states. [2020-07-29 01:27:38,142 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 28 transitions. Second operand 26 states. [2020-07-29 01:27:38,143 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 26 states. [2020-07-29 01:27:38,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:38,144 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-29 01:27:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-29 01:27:38,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:38,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:38,144 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states and 28 transitions. [2020-07-29 01:27:38,144 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states and 28 transitions. [2020-07-29 01:27:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:38,145 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-29 01:27:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-29 01:27:38,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:38,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:38,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:38,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 01:27:38,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-07-29 01:27:38,147 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-07-29 01:27:38,147 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-07-29 01:27:38,147 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-29 01:27:38,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2020-07-29 01:27:38,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:38,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:38,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:38,149 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2020-07-29 01:27:38,149 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:38,149 INFO L794 eck$LassoCheckResult]: Stem: 1209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1202#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; 1203#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; 1206#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1207#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; 1208#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1210#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; 1227#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1226#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; 1225#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1224#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; 1223#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1222#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; 1221#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1220#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; 1219#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1218#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; 1217#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1216#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; 1215#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1214#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; 1213#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1212#L13-3 assume !(main_~n~0 < 10); 1205#L17-4 [2020-07-29 01:27:38,149 INFO L796 eck$LassoCheckResult]: Loop: 1205#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 1211#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; 1204#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;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; 1205#L17-4 [2020-07-29 01:27:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2020-07-29 01:27:38,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:38,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98701908] [2020-07-29 01:27:38,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:38,176 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:38,190 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:38,196 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:38,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:38,196 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2020-07-29 01:27:38,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:38,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815079740] [2020-07-29 01:27:38,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:38,201 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:38,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:38,205 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:38,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:38,205 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2020-07-29 01:27:38,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:38,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470402768] [2020-07-29 01:27:38,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:38,234 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:38,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:38,300 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:42,154 WARN L193 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 212 DAG size of output: 149 [2020-07-29 01:27:42,387 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-07-29 01:27:42,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:27:42 BoogieIcfgContainer [2020-07-29 01:27:42,431 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:27:42,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:27:42,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:27:42,432 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:27:42,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:27:29" (3/4) ... [2020-07-29 01:27:42,436 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 01:27:42,487 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:27:42,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:27:42,490 INFO L168 Benchmark]: Toolchain (without parser) took 13464.28 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.1 MB). Free memory was 956.2 MB in the beginning and 1.3 GB in the end (delta: -316.9 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:42,490 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:27:42,491 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.06 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:42,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:42,492 INFO L168 Benchmark]: Boogie Preprocessor took 40.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:27:42,493 INFO L168 Benchmark]: RCFGBuilder took 355.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:42,493 INFO L168 Benchmark]: BuchiAutomizer took 12580.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -186.9 MB). Peak memory consumption was 455.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:42,493 INFO L168 Benchmark]: Witness Printer took 55.85 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:42,496 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.06 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 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 103.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 355.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12580.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -186.9 MB). Peak memory consumption was 455.0 MB. Max. memory is 11.5 GB. * Witness Printer took 55.85 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 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 12.4s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 10.6s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.1s 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, 66 SDslu, 246 SDs, 0 SdLazy, 193 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s 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: 22ms 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@2a19de3f=0, NULL=0, \result=0, NULL=1, n=10, i=9, a=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27f244fb=9, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@35dbe740=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f498a4b=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f39c84b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@243e6b61=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...