./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-1.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-1.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 76e89a58b9c6f7059fcf416ee7a1666558a3d440 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:16,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:27:16,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:27:16,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:27:16,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:27:16,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:27:16,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:27:16,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:27:16,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:27:16,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:27:16,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:27:16,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:27:16,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:27:16,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:27:16,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:27:16,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:27:16,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:27:16,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:27:16,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:27:16,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:27:16,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:27:16,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:27:16,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:27:16,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:27:16,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:27:16,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:27:16,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:27:16,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:27:16,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:27:16,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:27:16,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:27:16,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:27:16,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:27:16,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:27:16,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:27:16,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:27:16,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:27:16,832 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:27:16,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:27:16,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:27:16,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:27:16,835 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:16,853 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:27:16,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:27:16,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:27:16,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:27:16,855 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:27:16,855 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:27:16,856 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:27:16,856 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:27:16,856 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:27:16,856 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:27:16,857 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:27:16,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:27:16,857 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:27:16,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:27:16,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:27:16,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:27:16,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:27:16,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:27:16,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:27:16,859 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:27:16,859 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:27:16,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:27:16,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:27:16,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:27:16,860 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:27:16,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:27:16,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:27:16,861 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:27:16,862 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:27:16,863 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:27:16,863 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 -> 76e89a58b9c6f7059fcf416ee7a1666558a3d440 [2020-07-29 01:27:17,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:27:17,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:27:17,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:27:17,191 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:27:17,192 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:27:17,193 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2020-07-29 01:27:17,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/676f0076b/6272130d65ff4d48bd44faa1fad32dd7/FLAG774606c85 [2020-07-29 01:27:17,679 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:27:17,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2020-07-29 01:27:17,687 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/676f0076b/6272130d65ff4d48bd44faa1fad32dd7/FLAG774606c85 [2020-07-29 01:27:18,092 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/676f0076b/6272130d65ff4d48bd44faa1fad32dd7 [2020-07-29 01:27:18,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:27:18,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:27:18,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:27:18,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:27:18,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:27:18,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:27:18" (1/1) ... [2020-07-29 01:27:18,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abd86f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:18, skipping insertion in model container [2020-07-29 01:27:18,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:27:18" (1/1) ... [2020-07-29 01:27:18,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:27:18,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:27:18,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:27:18,332 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:27:18,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:27:18,387 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:27:18,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:18 WrapperNode [2020-07-29 01:27:18,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:27:18,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:27:18,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:27:18,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:27:18,403 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:18" (1/1) ... [2020-07-29 01:27:18,505 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:18" (1/1) ... [2020-07-29 01:27:18,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:27:18,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:27:18,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:27:18,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:27:18,553 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:18" (1/1) ... [2020-07-29 01:27:18,553 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:18" (1/1) ... [2020-07-29 01:27:18,564 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:18" (1/1) ... [2020-07-29 01:27:18,565 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:18" (1/1) ... [2020-07-29 01:27:18,582 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:18" (1/1) ... [2020-07-29 01:27:18,590 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:18" (1/1) ... [2020-07-29 01:27:18,595 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:18" (1/1) ... [2020-07-29 01:27:18,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:27:18,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:27:18,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:27:18,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:27:18,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:18" (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:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:27:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:27:18,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:27:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:27:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:27:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:27:19,066 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:27:19,067 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:27:19,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:27:19 BoogieIcfgContainer [2020-07-29 01:27:19,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:27:19,071 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:27:19,072 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:27:19,076 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:27:19,077 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:19,077 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:27:18" (1/3) ... [2020-07-29 01:27:19,078 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b974d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:27:19, skipping insertion in model container [2020-07-29 01:27:19,079 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:19,079 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:18" (2/3) ... [2020-07-29 01:27:19,079 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b974d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:27:19, skipping insertion in model container [2020-07-29 01:27:19,080 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:19,080 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:27:19" (3/3) ... [2020-07-29 01:27:19,082 INFO L371 chiAutomizerObserver]: Analyzing ICFG NonTermination3-1.c [2020-07-29 01:27:19,146 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:27:19,146 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:27:19,146 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:27:19,146 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:27:19,146 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:27:19,147 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:27:19,147 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:27:19,147 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:27:19,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:27:19,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:27:19,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:19,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:19,189 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:27:19,189 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:27:19,189 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:27:19,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:27:19,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:27:19,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:19,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:19,193 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:27:19,193 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:27:19,199 INFO L794 eck$LassoCheckResult]: Stem: 6#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:19,200 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; 7#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:19,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:19,205 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:27:19,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:19,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313126893] [2020-07-29 01:27:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:19,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:19,323 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:19,344 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:19,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:19,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-07-29 01:27:19,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:19,347 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644641000] [2020-07-29 01:27:19,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:19,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:19,365 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:19,369 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:19,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:19,375 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-07-29 01:27:19,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:19,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922006940] [2020-07-29 01:27:19,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:19,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:19,413 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:19,418 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:19,690 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:19,691 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:19,691 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:19,691 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:19,692 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:19,692 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:19,692 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:19,692 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:19,693 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-1.c_Iteration1_Lasso [2020-07-29 01:27:19,693 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:19,693 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:19,738 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:19,748 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:19,753 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:19,758 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:19,844 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:19,849 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:19,858 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:19,867 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:19,875 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:19,882 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:20,186 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-07-29 01:27:20,451 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:20,455 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:20,460 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:20,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:20,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:20,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:20,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:20,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:20,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:20,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:20,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:20,497 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:20,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:20,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:20,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:20,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:20,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:20,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:20,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:20,507 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:20,540 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:20,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:20,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:20,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:20,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:20,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:20,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:20,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:20,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:20,569 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:20,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:20,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:20,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:20,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:20,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:27:20,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:27:20,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:20,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:27:20,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:20,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:20,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:20,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:20,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:27:20,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:20,658 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:20,710 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:20,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:20,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:20,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:20,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:20,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:27:20,723 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:20,732 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:20,760 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:20,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:20,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:20,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:20,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:20,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:20,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:20,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:20,765 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:20,788 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:20,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:20,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:20,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:20,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:20,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:20,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:20,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:20,793 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:20,821 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:20,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:20,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:20,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:20,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:20,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:27:20,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:27:20,852 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:20,895 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 01:27:20,896 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) [2020-07-29 01:27:20,902 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:20,908 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:27:20,909 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:20,910 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:20,957 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:27:20,962 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:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:27:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:21,050 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:21,052 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:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:21,090 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:21,092 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:21,093 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:21,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:27:21,119 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:21,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:21,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,129 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:21,131 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2020-07-29 01:27:21,261 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:21,262 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:21,262 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:21,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:27:21,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:27:21,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:21,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:21,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:27:21,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:27:21,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:21,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:21,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 40 transitions. [2020-07-29 01:27:21,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:21,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:21,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:21,285 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states. [2020-07-29 01:27:21,293 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:27:21,295 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:27:21,295 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:27:21,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:27:21,302 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:27:21,302 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 40 transitions. cyclomatic complexity: 16 [2020-07-29 01:27:21,303 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:21,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:21,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:21,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,305 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:21,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:21,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:21,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,307 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:21,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:21,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:21,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,310 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:21,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:27:21,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:27:21,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,312 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:21,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:27:21,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:27:21,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,316 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:21,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:21,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:21,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,317 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:21,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:21,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:21,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,327 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:21,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:21,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:21,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,328 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:21,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:21,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:27:21,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,330 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:21,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:21,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:21,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,331 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:21,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:27:21,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:27:21,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,335 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:21,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:27:21,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:27:21,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,336 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:21,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:21,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:27:21,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,339 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:21,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:21,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:21,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,340 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:21,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:21,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:27:21,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,343 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:21,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:21,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:21,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,345 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:21,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,346 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:27:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-07-29 01:27:21,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:27:21,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:27:21,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:27:21,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. cyclomatic complexity: 16 [2020-07-29 01:27:21,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:21,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2020-07-29 01:27:21,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:21,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:27:21,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-07-29 01:27:21,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:21,380 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-07-29 01:27:21,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-07-29 01:27:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-07-29 01:27:21,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:21,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 12 transitions. Second operand 8 states. [2020-07-29 01:27:21,435 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 12 transitions. Second operand 8 states. [2020-07-29 01:27:21,438 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 8 states. [2020-07-29 01:27:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:21,446 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2020-07-29 01:27:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2020-07-29 01:27:21,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:21,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:21,451 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states and 12 transitions. [2020-07-29 01:27:21,451 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states and 12 transitions. [2020-07-29 01:27:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:21,452 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2020-07-29 01:27:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2020-07-29 01:27:21,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:21,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:21,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:21,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:27:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-07-29 01:27:21,460 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:27:21,460 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:27:21,460 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:27:21,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:27:21,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:21,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:21,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:21,463 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:27:21,463 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:21,464 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:21,464 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;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 92#L17-4 [2020-07-29 01:27:21,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:21,465 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2020-07-29 01:27:21,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:21,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744939139] [2020-07-29 01:27:21,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,533 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:21,534 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:21,535 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:21,536 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:21,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744939139] [2020-07-29 01:27:21,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:27:21,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:27:21,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560726991] [2020-07-29 01:27:21,542 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:21,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:21,542 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2020-07-29 01:27:21,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:21,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527548727] [2020-07-29 01:27:21,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:21,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:21,562 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:21,565 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:21,674 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-07-29 01:27:21,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:21,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:27:21,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:27:21,730 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:27:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:21,762 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:27:21,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:27:21,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:27:21,768 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:21,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2020-07-29 01:27:21,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:21,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2020-07-29 01:27:21,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:21,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:21,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-07-29 01:27:21,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:21,771 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 01:27:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-07-29 01:27:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-07-29 01:27:21,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:21,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 11 transitions. Second operand 8 states. [2020-07-29 01:27:21,773 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 11 transitions. Second operand 8 states. [2020-07-29 01:27:21,773 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 8 states. [2020-07-29 01:27:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:21,774 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:27:21,774 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:27:21,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:21,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:21,775 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states and 11 transitions. [2020-07-29 01:27:21,775 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states and 11 transitions. [2020-07-29 01:27:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:21,776 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:27:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:27:21,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:21,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:21,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:21,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:21,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:27:21,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-07-29 01:27:21,779 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:27:21,779 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:27:21,779 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:27:21,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-07-29 01:27:21,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:21,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:21,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:21,780 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:27:21,781 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:21,781 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:21,781 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;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 133#L17-4 [2020-07-29 01:27:21,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:21,782 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2020-07-29 01:27:21,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:21,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50166471] [2020-07-29 01:27:21,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,833 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:21,834 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:21,835 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:21,836 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:21,837 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:21,838 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:21,838 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50166471] [2020-07-29 01:27:21,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522148181] [2020-07-29 01:27:21,839 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:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:27:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:21,953 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:21,957 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:21,958 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:21,959 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:21,960 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:21,961 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:21,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:21,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2020-07-29 01:27:21,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361675903] [2020-07-29 01:27:21,966 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:21,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:21,966 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2020-07-29 01:27:21,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:21,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060319741] [2020-07-29 01:27:21,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:21,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:22,002 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:22,007 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:22,186 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-07-29 01:27:22,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:22,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:27:22,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:27:22,251 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-07-29 01:27:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:22,305 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:27:22,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:27:22,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:27:22,319 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:22,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2020-07-29 01:27:22,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:22,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2020-07-29 01:27:22,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:22,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:22,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2020-07-29 01:27:22,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:22,322 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 01:27:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2020-07-29 01:27:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-07-29 01:27:22,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:22,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:27:22,324 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:27:22,324 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:27:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:22,325 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:27:22,325 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:27:22,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:22,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:22,325 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 11 states and 13 transitions. [2020-07-29 01:27:22,325 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 11 states and 13 transitions. [2020-07-29 01:27:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:22,327 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:27:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:27:22,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:22,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:22,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:22,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:27:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2020-07-29 01:27:22,328 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-07-29 01:27:22,329 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-07-29 01:27:22,329 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:27:22,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-07-29 01:27:22,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:22,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:22,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:22,330 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-07-29 01:27:22,330 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:22,330 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:22,330 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;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 194#L17-4 [2020-07-29 01:27:22,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:22,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2020-07-29 01:27:22,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:22,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698734017] [2020-07-29 01:27:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:22,380 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:22,381 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:22,382 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:22,382 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:22,383 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:22,384 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:22,385 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:22,386 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:22,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698734017] [2020-07-29 01:27:22,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378804101] [2020-07-29 01:27:22,386 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:22,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:27:22,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:22,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:22,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:22,505 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:22,506 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:22,507 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:22,507 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:22,508 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:22,509 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:22,512 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:22,512 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:22,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:22,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-29 01:27:22,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972630826] [2020-07-29 01:27:22,514 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:22,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:22,514 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2020-07-29 01:27:22,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:22,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873735830] [2020-07-29 01:27:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:22,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:22,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:22,530 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:22,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:22,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:27:22,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:27:22,677 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2020-07-29 01:27:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:22,728 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-07-29 01:27:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:27:22,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:27:22,742 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:22,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2020-07-29 01:27:22,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:22,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2020-07-29 01:27:22,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:22,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:22,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2020-07-29 01:27:22,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:22,746 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-07-29 01:27:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2020-07-29 01:27:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-07-29 01:27:22,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:22,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 15 transitions. Second operand 12 states. [2020-07-29 01:27:22,747 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 15 transitions. Second operand 12 states. [2020-07-29 01:27:22,747 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 12 states. [2020-07-29 01:27:22,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:22,748 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-07-29 01:27:22,749 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-07-29 01:27:22,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:22,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:22,749 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 13 states and 15 transitions. [2020-07-29 01:27:22,749 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 13 states and 15 transitions. [2020-07-29 01:27:22,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:22,750 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-07-29 01:27:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-07-29 01:27:22,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:22,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:22,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:22,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:27:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2020-07-29 01:27:22,752 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-07-29 01:27:22,752 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-07-29 01:27:22,752 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:27:22,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2020-07-29 01:27:22,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:22,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:22,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:22,753 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2020-07-29 01:27:22,753 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:22,753 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:22,753 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;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 266#L17-4 [2020-07-29 01:27:22,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:22,754 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2020-07-29 01:27:22,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:22,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464893084] [2020-07-29 01:27:22,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:22,808 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:22,809 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:22,810 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:22,810 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:22,811 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:22,811 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:22,812 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:22,812 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:22,813 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:22,813 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:22,814 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464893084] [2020-07-29 01:27:22,814 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829840382] [2020-07-29 01:27:22,814 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:22,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-29 01:27:22,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:22,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:27:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:22,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:22,950 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:22,951 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:22,952 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:22,953 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:22,954 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:22,954 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:22,955 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:22,956 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:22,956 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:22,957 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:22,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:22,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-29 01:27:22,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327883626] [2020-07-29 01:27:22,958 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:22,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:22,959 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2020-07-29 01:27:22,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:22,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184757518] [2020-07-29 01:27:22,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:22,969 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:22,983 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:22,985 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:23,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:23,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:27:23,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:27:23,117 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-07-29 01:27:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:23,197 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-29 01:27:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:27:23,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:27:23,214 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:23,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-07-29 01:27:23,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:23,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2020-07-29 01:27:23,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:23,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:23,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2020-07-29 01:27:23,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:23,218 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-29 01:27:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2020-07-29 01:27:23,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-07-29 01:27:23,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:23,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 17 transitions. Second operand 14 states. [2020-07-29 01:27:23,220 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 17 transitions. Second operand 14 states. [2020-07-29 01:27:23,220 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 14 states. [2020-07-29 01:27:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:23,221 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-29 01:27:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-29 01:27:23,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:23,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:23,221 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states and 17 transitions. [2020-07-29 01:27:23,221 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states and 17 transitions. [2020-07-29 01:27:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:23,223 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-29 01:27:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-29 01:27:23,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:23,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:23,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:23,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:27:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-07-29 01:27:23,224 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-07-29 01:27:23,225 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-07-29 01:27:23,225 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:27:23,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2020-07-29 01:27:23,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:23,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:23,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:23,226 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2020-07-29 01:27:23,226 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:23,226 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:23,226 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;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 355#L17-4 [2020-07-29 01:27:23,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:23,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2020-07-29 01:27:23,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:23,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622588674] [2020-07-29 01:27:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:23,317 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:23,318 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:23,319 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:23,323 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:23,324 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:23,325 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:23,326 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:23,327 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:23,328 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:23,329 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:23,330 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:23,331 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:23,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622588674] [2020-07-29 01:27:23,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030132544] [2020-07-29 01:27:23,332 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:23,365 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 01:27:23,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:23,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:27:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:23,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:23,511 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:23,514 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:23,515 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:23,516 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:23,517 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:23,517 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:23,518 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:23,519 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:23,519 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:23,521 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:23,523 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:23,524 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:23,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:23,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-29 01:27:23,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107406151] [2020-07-29 01:27:23,525 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:23,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:23,526 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2020-07-29 01:27:23,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:23,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495186414] [2020-07-29 01:27:23,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:23,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:23,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:23,538 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:23,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:23,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:27:23,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:27:23,679 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2020-07-29 01:27:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:23,753 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 01:27:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:27:23,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:27:23,772 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:23,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2020-07-29 01:27:23,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:23,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2020-07-29 01:27:23,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:23,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:23,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-07-29 01:27:23,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:23,775 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-29 01:27:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-07-29 01:27:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-07-29 01:27:23,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:23,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 19 transitions. Second operand 16 states. [2020-07-29 01:27:23,777 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 19 transitions. Second operand 16 states. [2020-07-29 01:27:23,777 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 16 states. [2020-07-29 01:27:23,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:23,778 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 01:27:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-29 01:27:23,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:23,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:23,779 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states and 19 transitions. [2020-07-29 01:27:23,779 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states and 19 transitions. [2020-07-29 01:27:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:23,780 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 01:27:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-29 01:27:23,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:23,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:23,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:23,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:27:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-29 01:27:23,782 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-29 01:27:23,782 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-29 01:27:23,782 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:27:23,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2020-07-29 01:27:23,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:23,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:23,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:23,783 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2020-07-29 01:27:23,783 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:23,783 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:23,783 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;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 459#L17-4 [2020-07-29 01:27:23,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:23,784 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2020-07-29 01:27:23,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:23,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388961312] [2020-07-29 01:27:23,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:23,870 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:23,871 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:23,872 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:23,872 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:23,873 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:23,874 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:23,874 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:23,875 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:23,876 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:23,877 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:23,878 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:23,878 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:23,879 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:23,880 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:23,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388961312] [2020-07-29 01:27:23,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984748974] [2020-07-29 01:27:23,880 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:23,920 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-29 01:27:23,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:23,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:23,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:24,059 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:24,060 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:24,061 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:24,062 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:24,062 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:24,063 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:24,064 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:24,065 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:24,065 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:24,066 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:24,067 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:24,068 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:24,069 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:24,069 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:24,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:24,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-29 01:27:24,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797563234] [2020-07-29 01:27:24,071 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:24,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:24,071 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2020-07-29 01:27:24,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:24,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400723478] [2020-07-29 01:27:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:24,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:24,081 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:24,083 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:24,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:24,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:27:24,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:27:24,224 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2020-07-29 01:27:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:24,336 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-29 01:27:24,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:27:24,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:27:24,365 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:24,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2020-07-29 01:27:24,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:24,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2020-07-29 01:27:24,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:24,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:24,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2020-07-29 01:27:24,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:24,369 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-29 01:27:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2020-07-29 01:27:24,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-07-29 01:27:24,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:24,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 21 transitions. Second operand 18 states. [2020-07-29 01:27:24,371 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 21 transitions. Second operand 18 states. [2020-07-29 01:27:24,372 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 18 states. [2020-07-29 01:27:24,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:24,373 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-29 01:27:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-29 01:27:24,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:24,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:24,374 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 19 states and 21 transitions. [2020-07-29 01:27:24,374 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 19 states and 21 transitions. [2020-07-29 01:27:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:24,375 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-29 01:27:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-29 01:27:24,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:24,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:24,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:24,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:27:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-29 01:27:24,377 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-29 01:27:24,377 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-29 01:27:24,377 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:27:24,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-07-29 01:27:24,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:24,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:24,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:24,379 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2020-07-29 01:27:24,379 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:24,379 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:24,379 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;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 578#L17-4 [2020-07-29 01:27:24,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:24,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2020-07-29 01:27:24,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:24,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024440489] [2020-07-29 01:27:24,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:24,513 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:24,515 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:24,515 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:24,516 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:24,516 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:24,517 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:24,518 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:24,518 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:24,519 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:24,520 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:24,523 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:24,525 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:24,525 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:24,526 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:24,527 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:24,527 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:24,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024440489] [2020-07-29 01:27:24,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373248160] [2020-07-29 01:27:24,528 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:24,569 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-29 01:27:24,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:24,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:27:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:24,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:24,775 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:24,777 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:24,777 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:24,778 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:24,779 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:24,780 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:24,780 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:24,781 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:24,782 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:24,783 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:24,784 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:24,785 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:24,786 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:24,787 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:24,787 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:24,788 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:24,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:24,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-07-29 01:27:24,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178035106] [2020-07-29 01:27:24,789 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:24,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:24,790 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2020-07-29 01:27:24,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:24,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910495652] [2020-07-29 01:27:24,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:24,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:24,800 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:24,801 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:24,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:24,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:27:24,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:27:24,942 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2020-07-29 01:27:25,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:25,029 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-29 01:27:25,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:27:25,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:27:25,053 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:25,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2020-07-29 01:27:25,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:25,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2020-07-29 01:27:25,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:25,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:25,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2020-07-29 01:27:25,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:25,057 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-29 01:27:25,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2020-07-29 01:27:25,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-29 01:27:25,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:25,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 23 transitions. Second operand 20 states. [2020-07-29 01:27:25,059 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 23 transitions. Second operand 20 states. [2020-07-29 01:27:25,060 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 20 states. [2020-07-29 01:27:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:25,061 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-29 01:27:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-29 01:27:25,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:25,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:25,062 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states and 23 transitions. [2020-07-29 01:27:25,062 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states and 23 transitions. [2020-07-29 01:27:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:25,063 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-29 01:27:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-29 01:27:25,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:25,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:25,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:25,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:27:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-07-29 01:27:25,066 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-29 01:27:25,066 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-29 01:27:25,066 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:27:25,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2020-07-29 01:27:25,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:25,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:25,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:25,068 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2020-07-29 01:27:25,068 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:25,069 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:25,069 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;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 712#L17-4 [2020-07-29 01:27:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2020-07-29 01:27:25,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:25,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878832650] [2020-07-29 01:27:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:25,193 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:25,196 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:25,198 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:25,198 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:25,199 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:25,199 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:25,200 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:25,200 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:25,201 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:25,202 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:25,202 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:25,203 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:25,203 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:25,204 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:25,204 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:25,205 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:25,205 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:25,206 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:25,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878832650] [2020-07-29 01:27:25,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348326243] [2020-07-29 01:27:25,207 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:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:25,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:27:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:25,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:25,450 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:25,451 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:25,453 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:25,454 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:25,454 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:25,455 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:25,455 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:25,456 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:25,456 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:25,457 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:25,457 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:25,458 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:25,458 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:25,459 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:25,459 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:25,460 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:25,461 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:25,461 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:25,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:25,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-07-29 01:27:25,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290491366] [2020-07-29 01:27:25,462 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:25,463 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2020-07-29 01:27:25,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:25,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681461713] [2020-07-29 01:27:25,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:25,468 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:25,472 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:25,473 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:25,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:25,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:27:25,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:27:25,613 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2020-07-29 01:27:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:25,699 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-29 01:27:25,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:27:25,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:27:25,732 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:25,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2020-07-29 01:27:25,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:25,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2020-07-29 01:27:25,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:25,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:25,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2020-07-29 01:27:25,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:25,735 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-29 01:27:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2020-07-29 01:27:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-29 01:27:25,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:25,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 25 transitions. Second operand 22 states. [2020-07-29 01:27:25,737 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 25 transitions. Second operand 22 states. [2020-07-29 01:27:25,738 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 22 states. [2020-07-29 01:27:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:25,739 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-29 01:27:25,739 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-29 01:27:25,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:25,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:25,740 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states and 25 transitions. [2020-07-29 01:27:25,740 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states and 25 transitions. [2020-07-29 01:27:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:25,741 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-29 01:27:25,742 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-29 01:27:25,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:25,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:25,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:25,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:27:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-29 01:27:25,744 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-29 01:27:25,744 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-29 01:27:25,744 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 01:27:25,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2020-07-29 01:27:25,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:25,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:25,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:25,746 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2020-07-29 01:27:25,746 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:25,746 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:25,747 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;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 863#L17-4 [2020-07-29 01:27:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2020-07-29 01:27:25,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:25,748 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639228281] [2020-07-29 01:27:25,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:25,880 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:25,881 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:25,882 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:25,883 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:25,883 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:25,884 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:25,884 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:25,885 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:25,885 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:25,886 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:25,887 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:25,887 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:25,888 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:25,888 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:25,889 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:25,889 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:25,890 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:25,890 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:25,891 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:25,891 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:25,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639228281] [2020-07-29 01:27:25,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094736113] [2020-07-29 01:27:25,892 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:25,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:27:25,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:25,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:27:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:25,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:26,143 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:26,147 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:26,147 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:26,148 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:26,149 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:26,149 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:26,150 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:26,151 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:26,151 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:26,152 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:26,153 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:26,154 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:26,155 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:26,157 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:26,157 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:26,158 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:26,159 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:26,160 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:26,160 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:26,161 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:26,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:26,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-07-29 01:27:26,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274546582] [2020-07-29 01:27:26,162 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:26,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:26,162 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2020-07-29 01:27:26,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:26,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705968113] [2020-07-29 01:27:26,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:26,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:26,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:26,187 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:26,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:26,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:27:26,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:27:26,332 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2020-07-29 01:27:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:26,465 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-29 01:27:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:27:26,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:27:26,498 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:26,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2020-07-29 01:27:26,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:26,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2020-07-29 01:27:26,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:26,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:26,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2020-07-29 01:27:26,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:26,501 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-29 01:27:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2020-07-29 01:27:26,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-07-29 01:27:26,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:26,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 27 transitions. Second operand 24 states. [2020-07-29 01:27:26,503 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 27 transitions. Second operand 24 states. [2020-07-29 01:27:26,503 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 24 states. [2020-07-29 01:27:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:26,504 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-29 01:27:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-29 01:27:26,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:26,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:26,505 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states and 27 transitions. [2020-07-29 01:27:26,505 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states and 27 transitions. [2020-07-29 01:27:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:26,506 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-29 01:27:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-29 01:27:26,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:26,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:26,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:26,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:27:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-29 01:27:26,507 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-29 01:27:26,508 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-29 01:27:26,508 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 01:27:26,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2020-07-29 01:27:26,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:26,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:26,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:26,509 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2020-07-29 01:27:26,509 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:26,510 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:26,510 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;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1027#L17-4 [2020-07-29 01:27:26,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:26,510 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2020-07-29 01:27:26,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:26,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109378647] [2020-07-29 01:27:26,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:26,646 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:26,648 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:26,655 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:26,656 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:26,656 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:26,657 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:26,662 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:26,663 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:26,663 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:26,664 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:26,664 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:26,665 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:26,665 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:26,666 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:26,666 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:26,667 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:26,667 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:26,668 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:26,668 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:26,669 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:26,670 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:26,670 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:26,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109378647] [2020-07-29 01:27:26,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008403433] [2020-07-29 01:27:26,671 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:26,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-07-29 01:27:26,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:26,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:27:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:26,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:26,993 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:26,994 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:26,995 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:26,996 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:26,996 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:26,997 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:26,998 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:26,999 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:26,999 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:27,000 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:27,001 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:27,001 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:27,002 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:27,003 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:27,003 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:27,004 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:27,005 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:27,006 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:27,006 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:27,007 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:27,008 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:27,009 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:27,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:27,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-07-29 01:27:27,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402825194] [2020-07-29 01:27:27,010 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:27,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:27,010 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2020-07-29 01:27:27,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:27,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088560190] [2020-07-29 01:27:27,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:27,016 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:27,019 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:27,021 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:27,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:27,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:27:27,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:27:27,178 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2020-07-29 01:27:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:27,308 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-29 01:27:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-29 01:27:27,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:27:27,352 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:27,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-07-29 01:27:27,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:27,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2020-07-29 01:27:27,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:27:27,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:27:27,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2020-07-29 01:27:27,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:27,356 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-07-29 01:27:27,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2020-07-29 01:27:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-29 01:27:27,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:27,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 28 transitions. Second operand 26 states. [2020-07-29 01:27:27,359 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 28 transitions. Second operand 26 states. [2020-07-29 01:27:27,359 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 26 states. [2020-07-29 01:27:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:27,360 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-29 01:27:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-29 01:27:27,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:27,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:27,361 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states and 28 transitions. [2020-07-29 01:27:27,361 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states and 28 transitions. [2020-07-29 01:27:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:27,362 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-29 01:27:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-29 01:27:27,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:27,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:27,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:27,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 01:27:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-07-29 01:27:27,364 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-07-29 01:27:27,364 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-07-29 01:27:27,364 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-29 01:27:27,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2020-07-29 01:27:27,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:27,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:27,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:27,366 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2020-07-29 01:27:27,366 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:27,366 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:27,366 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;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1205#L17-4 [2020-07-29 01:27:27,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:27,366 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2020-07-29 01:27:27,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:27,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055733065] [2020-07-29 01:27:27,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:27,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:27,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:27,404 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:27,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:27,405 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2020-07-29 01:27:27,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:27,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700509747] [2020-07-29 01:27:27,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:27,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:27,413 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:27,414 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:27,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:27,415 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2020-07-29 01:27:27,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:27,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194194051] [2020-07-29 01:27:27,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:27,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:27,477 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:27,483 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:31,458 WARN L193 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 212 DAG size of output: 149 [2020-07-29 01:27:31,718 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-07-29 01:27:31,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:27:31 BoogieIcfgContainer [2020-07-29 01:27:31,764 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:27:31,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:27:31,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:27:31,765 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:27:31,766 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:19" (3/4) ... [2020-07-29 01:27:31,769 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 01:27:31,818 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:27:31,818 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:27:31,821 INFO L168 Benchmark]: Toolchain (without parser) took 13723.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 956.2 MB in the beginning and 1.2 GB in the end (delta: -215.6 MB). Peak memory consumption was 98.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:31,821 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:27:31,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.54 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:31,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 151.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:31,823 INFO L168 Benchmark]: Boogie Preprocessor took 60.61 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:31,824 INFO L168 Benchmark]: RCFGBuilder took 468.30 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:31,824 INFO L168 Benchmark]: BuchiAutomizer took 12692.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -48.0 MB). Peak memory consumption was 107.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:31,825 INFO L168 Benchmark]: Witness Printer took 53.99 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2020-07-29 01:27:31,827 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.54 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 151.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.61 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 468.30 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 12692.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -48.0 MB). Peak memory consumption was 107.7 MB. Max. memory is 11.5 GB. * Witness Printer took 53.99 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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.6s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 10.8s. 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: 19ms 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@7bffac73=0, NULL=0, \result=0, NULL=1, n=10, i=8, a=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14f670d3=8, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@c7b1dae=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e9cf934=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f774d7f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@7611ae10=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] i = __VERIFIER_nondet_int() [L20] a[i] = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...