./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/id_build.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/id_build.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 8e693e301fe03afa61a3f7e2110361a5e60df7f9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 07:06:13,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 07:06:13,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 07:06:13,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 07:06:13,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 07:06:13,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 07:06:13,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 07:06:13,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 07:06:13,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 07:06:13,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 07:06:13,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 07:06:13,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 07:06:13,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 07:06:13,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 07:06:13,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 07:06:13,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 07:06:13,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 07:06:13,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 07:06:13,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 07:06:13,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 07:06:13,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 07:06:13,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 07:06:13,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 07:06:13,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 07:06:13,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 07:06:13,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 07:06:13,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 07:06:13,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 07:06:13,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 07:06:13,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 07:06:13,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 07:06:13,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 07:06:13,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 07:06:13,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 07:06:13,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 07:06:13,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 07:06:13,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 07:06:13,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 07:06:13,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 07:06:13,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 07:06:13,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 07:06:13,820 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 07:06:13,864 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 07:06:13,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 07:06:13,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 07:06:13,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 07:06:13,866 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 07:06:13,867 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 07:06:13,867 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 07:06:13,867 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 07:06:13,867 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 07:06:13,868 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 07:06:13,868 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 07:06:13,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 07:06:13,868 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 07:06:13,869 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 07:06:13,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 07:06:13,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 07:06:13,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 07:06:13,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 07:06:13,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 07:06:13,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 07:06:13,870 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 07:06:13,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 07:06:13,871 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 07:06:13,871 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 07:06:13,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 07:06:13,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 07:06:13,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 07:06:13,872 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 07:06:13,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 07:06:13,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 07:06:13,873 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 07:06:13,873 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 07:06:13,874 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 07:06:13,875 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e693e301fe03afa61a3f7e2110361a5e60df7f9 [2020-10-20 07:06:14,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 07:06:14,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 07:06:14,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 07:06:14,134 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 07:06:14,134 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 07:06:14,135 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/id_build.i [2020-10-20 07:06:14,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/060e89c5b/802ac42bf6b046f2b4939831f12bf06f/FLAGc734378c6 [2020-10-20 07:06:14,827 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 07:06:14,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2020-10-20 07:06:14,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/060e89c5b/802ac42bf6b046f2b4939831f12bf06f/FLAGc734378c6 [2020-10-20 07:06:15,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/060e89c5b/802ac42bf6b046f2b4939831f12bf06f [2020-10-20 07:06:15,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 07:06:15,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 07:06:15,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 07:06:15,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 07:06:15,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 07:06:15,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:06:15" (1/1) ... [2020-10-20 07:06:15,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62540067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:15, skipping insertion in model container [2020-10-20 07:06:15,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:06:15" (1/1) ... [2020-10-20 07:06:15,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 07:06:15,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 07:06:15,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:06:15,374 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 07:06:15,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:06:15,420 INFO L208 MainTranslator]: Completed translation [2020-10-20 07:06:15,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:15 WrapperNode [2020-10-20 07:06:15,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 07:06:15,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 07:06:15,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 07:06:15,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 07:06:15,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:15" (1/1) ... [2020-10-20 07:06:15,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:15" (1/1) ... [2020-10-20 07:06:15,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 07:06:15,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 07:06:15,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 07:06:15,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 07:06:15,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:15" (1/1) ... [2020-10-20 07:06:15,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:15" (1/1) ... [2020-10-20 07:06:15,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:15" (1/1) ... [2020-10-20 07:06:15,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:15" (1/1) ... [2020-10-20 07:06:15,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:15" (1/1) ... [2020-10-20 07:06:15,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:15" (1/1) ... [2020-10-20 07:06:15,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:15" (1/1) ... [2020-10-20 07:06:15,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 07:06:15,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 07:06:15,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 07:06:15,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 07:06:15,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 07:06:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 07:06:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 07:06:15,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 07:06:15,800 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 07:06:15,801 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-20 07:06:15,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:06:15 BoogieIcfgContainer [2020-10-20 07:06:15,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 07:06:15,804 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 07:06:15,805 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 07:06:15,809 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 07:06:15,811 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:06:15,811 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 07:06:15" (1/3) ... [2020-10-20 07:06:15,823 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c534b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:06:15, skipping insertion in model container [2020-10-20 07:06:15,824 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:06:15,824 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:15" (2/3) ... [2020-10-20 07:06:15,825 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c534b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:06:15, skipping insertion in model container [2020-10-20 07:06:15,825 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:06:15,825 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:06:15" (3/3) ... [2020-10-20 07:06:15,827 INFO L373 chiAutomizerObserver]: Analyzing ICFG id_build.i [2020-10-20 07:06:15,900 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 07:06:15,901 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 07:06:15,901 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 07:06:15,901 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 07:06:15,902 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 07:06:15,902 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 07:06:15,902 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 07:06:15,902 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 07:06:15,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-10-20 07:06:15,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-20 07:06:15,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:15,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:16,003 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:06:16,003 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:06:16,003 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 07:06:16,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-10-20 07:06:16,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-20 07:06:16,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:16,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:16,006 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:06:16,007 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:06:16,014 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 11#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 19#L27-3true [2020-10-20 07:06:16,014 INFO L796 eck$LassoCheckResult]: Loop: 19#L27-3true assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 4#L28-2true assume !(main_~j~0 < 8); 21#L27-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 19#L27-3true [2020-10-20 07:06:16,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:16,020 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 07:06:16,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:16,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628631730] [2020-10-20 07:06:16,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:16,139 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:16,153 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:16,175 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:16,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:16,177 INFO L82 PathProgramCache]: Analyzing trace with hash 39954, now seen corresponding path program 1 times [2020-10-20 07:06:16,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:16,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497723495] [2020-10-20 07:06:16,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:16,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497723495] [2020-10-20 07:06:16,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:06:16,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 07:06:16,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711709295] [2020-10-20 07:06:16,256 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:06:16,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:16,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 07:06:16,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 07:06:16,281 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-10-20 07:06:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:16,319 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-10-20 07:06:16,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 07:06:16,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2020-10-20 07:06:16,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-20 07:06:16,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 14 states and 15 transitions. [2020-10-20 07:06:16,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 07:06:16,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 07:06:16,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2020-10-20 07:06:16,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:06:16,332 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-10-20 07:06:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2020-10-20 07:06:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2020-10-20 07:06:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-20 07:06:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-10-20 07:06:16,367 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-10-20 07:06:16,368 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-10-20 07:06:16,368 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 07:06:16,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2020-10-20 07:06:16,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 07:06:16,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:16,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:16,370 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:06:16,370 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:06:16,371 INFO L794 eck$LassoCheckResult]: Stem: 61#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 56#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 57#L27-3 [2020-10-20 07:06:16,371 INFO L796 eck$LassoCheckResult]: Loop: 57#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 58#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 59#L18 assume !(0 == __VERIFIER_assert_~cond); 60#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 54#L18-3 assume !(0 == __VERIFIER_assert_~cond); 55#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 62#L28-2 assume !(main_~j~0 < 8); 63#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 57#L27-3 [2020-10-20 07:06:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 07:06:16,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:16,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374831872] [2020-10-20 07:06:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:16,385 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:16,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:16,400 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:16,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:16,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1814055911, now seen corresponding path program 1 times [2020-10-20 07:06:16,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:16,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129806985] [2020-10-20 07:06:16,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:16,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129806985] [2020-10-20 07:06:16,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595693005] [2020-10-20 07:06:16,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:06:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:16,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 07:06:16,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:16,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:06:16,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-10-20 07:06:16,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818159536] [2020-10-20 07:06:16,541 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:06:16,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:16,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 07:06:16,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 07:06:16,542 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-10-20 07:06:16,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:16,568 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-10-20 07:06:16,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 07:06:16,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2020-10-20 07:06:16,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-10-20 07:06:16,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2020-10-20 07:06:16,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-20 07:06:16,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-20 07:06:16,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2020-10-20 07:06:16,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:06:16,572 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-10-20 07:06:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2020-10-20 07:06:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2020-10-20 07:06:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 07:06:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-10-20 07:06:16,576 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-20 07:06:16,576 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-20 07:06:16,576 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 07:06:16,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-10-20 07:06:16,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-20 07:06:16,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:16,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:16,578 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:06:16,578 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1] [2020-10-20 07:06:16,579 INFO L794 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 113#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 114#L27-3 [2020-10-20 07:06:16,590 INFO L796 eck$LassoCheckResult]: Loop: 114#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 120#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 125#L18 assume !(0 == __VERIFIER_assert_~cond); 124#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 123#L18-3 assume !(0 == __VERIFIER_assert_~cond); 119#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 115#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 116#L18 assume !(0 == __VERIFIER_assert_~cond); 117#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 111#L18-3 assume !(0 == __VERIFIER_assert_~cond); 112#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 122#L28-2 assume !(main_~j~0 < 8); 121#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 114#L27-3 [2020-10-20 07:06:16,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:16,590 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 07:06:16,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:16,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024356873] [2020-10-20 07:06:16,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:16,603 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:16,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:16,627 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:16,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:16,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1818130318, now seen corresponding path program 2 times [2020-10-20 07:06:16,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:16,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068724804] [2020-10-20 07:06:16,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:16,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068724804] [2020-10-20 07:06:16,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486110371] [2020-10-20 07:06:16,704 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:06:16,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 07:06:16,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:06:16,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:06:16,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:16,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:06:16,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-10-20 07:06:16,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143141850] [2020-10-20 07:06:16,760 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:06:16,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:16,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:06:16,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:06:16,761 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand 5 states. [2020-10-20 07:06:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:16,786 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-10-20 07:06:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 07:06:16,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2020-10-20 07:06:16,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-10-20 07:06:16,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions. [2020-10-20 07:06:16,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-20 07:06:16,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-20 07:06:16,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2020-10-20 07:06:16,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:06:16,790 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-10-20 07:06:16,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2020-10-20 07:06:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2020-10-20 07:06:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 07:06:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-10-20 07:06:16,794 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-10-20 07:06:16,794 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-10-20 07:06:16,794 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 07:06:16,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2020-10-20 07:06:16,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-10-20 07:06:16,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:16,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:16,796 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:06:16,797 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 1, 1, 1] [2020-10-20 07:06:16,797 INFO L794 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 196#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 197#L27-3 [2020-10-20 07:06:16,797 INFO L796 eck$LassoCheckResult]: Loop: 197#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 203#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 213#L18 assume !(0 == __VERIFIER_assert_~cond); 212#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 211#L18-3 assume !(0 == __VERIFIER_assert_~cond); 202#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 198#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 199#L18 assume !(0 == __VERIFIER_assert_~cond); 201#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 194#L18-3 assume !(0 == __VERIFIER_assert_~cond); 195#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 210#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 206#L18 assume !(0 == __VERIFIER_assert_~cond); 209#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 208#L18-3 assume !(0 == __VERIFIER_assert_~cond); 207#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 205#L28-2 assume !(main_~j~0 < 8); 204#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 197#L27-3 [2020-10-20 07:06:16,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:16,798 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 07:06:16,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:16,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534945551] [2020-10-20 07:06:16,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:16,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:16,817 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:16,820 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:16,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:16,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1614576711, now seen corresponding path program 3 times [2020-10-20 07:06:16,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:16,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227603439] [2020-10-20 07:06:16,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:16,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227603439] [2020-10-20 07:06:16,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496278734] [2020-10-20 07:06:16,890 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:06:16,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 07:06:16,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:06:16,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 07:06:16,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:16,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:06:16,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-20 07:06:16,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909043906] [2020-10-20 07:06:16,958 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:06:16,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:16,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 07:06:16,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 07:06:16,959 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-10-20 07:06:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:17,005 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-10-20 07:06:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 07:06:17,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2020-10-20 07:06:17,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-10-20 07:06:17,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2020-10-20 07:06:17,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-10-20 07:06:17,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-10-20 07:06:17,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2020-10-20 07:06:17,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:06:17,010 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-10-20 07:06:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2020-10-20 07:06:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2020-10-20 07:06:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-20 07:06:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-10-20 07:06:17,016 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-10-20 07:06:17,016 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-10-20 07:06:17,016 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 07:06:17,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2020-10-20 07:06:17,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 07:06:17,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:17,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:17,018 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:06:17,018 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 1, 1, 1] [2020-10-20 07:06:17,021 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 303#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 304#L27-3 [2020-10-20 07:06:17,021 INFO L796 eck$LassoCheckResult]: Loop: 304#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 312#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 327#L18 assume !(0 == __VERIFIER_assert_~cond); 326#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 325#L18-3 assume !(0 == __VERIFIER_assert_~cond); 311#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 307#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 308#L18 assume !(0 == __VERIFIER_assert_~cond); 310#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 305#L18-3 assume !(0 == __VERIFIER_assert_~cond); 306#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 324#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 323#L18 assume !(0 == __VERIFIER_assert_~cond); 322#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 321#L18-3 assume !(0 == __VERIFIER_assert_~cond); 320#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 319#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 315#L18 assume !(0 == __VERIFIER_assert_~cond); 318#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 317#L18-3 assume !(0 == __VERIFIER_assert_~cond); 316#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 314#L28-2 assume !(main_~j~0 < 8); 313#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 304#L27-3 [2020-10-20 07:06:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:17,021 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-20 07:06:17,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:17,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326077952] [2020-10-20 07:06:17,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:17,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:17,052 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:17,056 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:17,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:17,057 INFO L82 PathProgramCache]: Analyzing trace with hash -909214510, now seen corresponding path program 4 times [2020-10-20 07:06:17,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:17,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566846900] [2020-10-20 07:06:17,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:17,135 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:17,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566846900] [2020-10-20 07:06:17,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826879423] [2020-10-20 07:06:17,136 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:06:17,186 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 07:06:17,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:06:17,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:06:17,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:17,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:06:17,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-10-20 07:06:17,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987255725] [2020-10-20 07:06:17,211 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:06:17,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:17,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 07:06:17,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 07:06:17,212 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand 7 states. [2020-10-20 07:06:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:17,241 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-10-20 07:06:17,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 07:06:17,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 35 transitions. [2020-10-20 07:06:17,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2020-10-20 07:06:17,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 35 transitions. [2020-10-20 07:06:17,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-10-20 07:06:17,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-10-20 07:06:17,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 35 transitions. [2020-10-20 07:06:17,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:06:17,245 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-10-20 07:06:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 35 transitions. [2020-10-20 07:06:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2020-10-20 07:06:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-20 07:06:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-10-20 07:06:17,248 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-10-20 07:06:17,248 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-10-20 07:06:17,248 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 07:06:17,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 31 transitions. [2020-10-20 07:06:17,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2020-10-20 07:06:17,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:17,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:17,250 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:06:17,250 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 5, 1, 1, 1] [2020-10-20 07:06:17,250 INFO L794 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 438#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 439#L27-3 [2020-10-20 07:06:17,251 INFO L796 eck$LassoCheckResult]: Loop: 439#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 447#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 467#L18 assume !(0 == __VERIFIER_assert_~cond); 466#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 465#L18-3 assume !(0 == __VERIFIER_assert_~cond); 446#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 442#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 443#L18 assume !(0 == __VERIFIER_assert_~cond); 445#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 440#L18-3 assume !(0 == __VERIFIER_assert_~cond); 441#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 464#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 463#L18 assume !(0 == __VERIFIER_assert_~cond); 462#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 461#L18-3 assume !(0 == __VERIFIER_assert_~cond); 460#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 459#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 458#L18 assume !(0 == __VERIFIER_assert_~cond); 457#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 456#L18-3 assume !(0 == __VERIFIER_assert_~cond); 455#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 454#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 450#L18 assume !(0 == __VERIFIER_assert_~cond); 453#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 452#L18-3 assume !(0 == __VERIFIER_assert_~cond); 451#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 449#L28-2 assume !(main_~j~0 < 8); 448#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 439#L27-3 [2020-10-20 07:06:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-20 07:06:17,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:17,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701868579] [2020-10-20 07:06:17,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:17,258 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:17,263 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:17,265 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:17,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:17,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1734363993, now seen corresponding path program 5 times [2020-10-20 07:06:17,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:17,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336184712] [2020-10-20 07:06:17,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:17,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336184712] [2020-10-20 07:06:17,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035253065] [2020-10-20 07:06:17,355 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:06:17,408 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-20 07:06:17,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:06:17,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:06:17,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:17,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:06:17,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-20 07:06:17,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076561854] [2020-10-20 07:06:17,436 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:06:17,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:17,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 07:06:17,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 07:06:17,437 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. cyclomatic complexity: 2 Second operand 8 states. [2020-10-20 07:06:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:17,473 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-10-20 07:06:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 07:06:17,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 40 transitions. [2020-10-20 07:06:17,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-10-20 07:06:17,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 40 transitions. [2020-10-20 07:06:17,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-10-20 07:06:17,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-10-20 07:06:17,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 40 transitions. [2020-10-20 07:06:17,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:06:17,476 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-10-20 07:06:17,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 40 transitions. [2020-10-20 07:06:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2020-10-20 07:06:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-20 07:06:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-10-20 07:06:17,480 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-10-20 07:06:17,480 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-10-20 07:06:17,480 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 07:06:17,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 36 transitions. [2020-10-20 07:06:17,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-10-20 07:06:17,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:17,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:17,482 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:06:17,483 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 6, 6, 1, 1, 1] [2020-10-20 07:06:17,483 INFO L794 eck$LassoCheckResult]: Stem: 606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 601#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 602#L27-3 [2020-10-20 07:06:17,483 INFO L796 eck$LassoCheckResult]: Loop: 602#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 608#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 633#L18 assume !(0 == __VERIFIER_assert_~cond); 632#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 631#L18-3 assume !(0 == __VERIFIER_assert_~cond); 607#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 603#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 604#L18 assume !(0 == __VERIFIER_assert_~cond); 605#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 599#L18-3 assume !(0 == __VERIFIER_assert_~cond); 600#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 630#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 629#L18 assume !(0 == __VERIFIER_assert_~cond); 628#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 627#L18-3 assume !(0 == __VERIFIER_assert_~cond); 626#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 625#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 624#L18 assume !(0 == __VERIFIER_assert_~cond); 623#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 622#L18-3 assume !(0 == __VERIFIER_assert_~cond); 621#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 620#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 619#L18 assume !(0 == __VERIFIER_assert_~cond); 618#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 617#L18-3 assume !(0 == __VERIFIER_assert_~cond); 616#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 615#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 611#L18 assume !(0 == __VERIFIER_assert_~cond); 614#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 613#L18-3 assume !(0 == __VERIFIER_assert_~cond); 612#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 610#L28-2 assume !(main_~j~0 < 8); 609#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 602#L27-3 [2020-10-20 07:06:17,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:17,484 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-20 07:06:17,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:17,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149957562] [2020-10-20 07:06:17,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:17,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:17,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:17,497 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:17,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:17,498 INFO L82 PathProgramCache]: Analyzing trace with hash 152926514, now seen corresponding path program 6 times [2020-10-20 07:06:17,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:17,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620487608] [2020-10-20 07:06:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:17,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620487608] [2020-10-20 07:06:17,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360681490] [2020-10-20 07:06:17,608 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:06:17,660 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-20 07:06:17,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:06:17,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 07:06:17,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:17,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:06:17,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-10-20 07:06:17,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478791472] [2020-10-20 07:06:17,724 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:06:17,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:17,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 07:06:17,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-20 07:06:17,725 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. cyclomatic complexity: 2 Second operand 9 states. [2020-10-20 07:06:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:17,772 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-10-20 07:06:17,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 07:06:17,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 45 transitions. [2020-10-20 07:06:17,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-10-20 07:06:17,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 45 transitions. [2020-10-20 07:06:17,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-10-20 07:06:17,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-10-20 07:06:17,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 45 transitions. [2020-10-20 07:06:17,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:06:17,779 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-10-20 07:06:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 45 transitions. [2020-10-20 07:06:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-10-20 07:06:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-20 07:06:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-10-20 07:06:17,786 INFO L714 BuchiCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-10-20 07:06:17,786 INFO L594 BuchiCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-10-20 07:06:17,787 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 07:06:17,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 41 transitions. [2020-10-20 07:06:17,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2020-10-20 07:06:17,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:17,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:17,789 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:06:17,789 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 7, 1, 1, 1] [2020-10-20 07:06:17,789 INFO L794 eck$LassoCheckResult]: Stem: 793#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 788#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 789#L27-3 [2020-10-20 07:06:17,790 INFO L796 eck$LassoCheckResult]: Loop: 789#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 795#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 825#L18 assume !(0 == __VERIFIER_assert_~cond); 824#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 823#L18-3 assume !(0 == __VERIFIER_assert_~cond); 794#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 790#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 791#L18 assume !(0 == __VERIFIER_assert_~cond); 792#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 786#L18-3 assume !(0 == __VERIFIER_assert_~cond); 787#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 822#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 821#L18 assume !(0 == __VERIFIER_assert_~cond); 820#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 819#L18-3 assume !(0 == __VERIFIER_assert_~cond); 818#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 817#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 816#L18 assume !(0 == __VERIFIER_assert_~cond); 815#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 814#L18-3 assume !(0 == __VERIFIER_assert_~cond); 813#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 812#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 811#L18 assume !(0 == __VERIFIER_assert_~cond); 810#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 809#L18-3 assume !(0 == __VERIFIER_assert_~cond); 808#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 807#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 806#L18 assume !(0 == __VERIFIER_assert_~cond); 805#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 804#L18-3 assume !(0 == __VERIFIER_assert_~cond); 803#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 802#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 798#L18 assume !(0 == __VERIFIER_assert_~cond); 801#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 800#L18-3 assume !(0 == __VERIFIER_assert_~cond); 799#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 797#L28-2 assume !(main_~j~0 < 8); 796#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 789#L27-3 [2020-10-20 07:06:17,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:17,790 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-20 07:06:17,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:17,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523577992] [2020-10-20 07:06:17,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:17,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:17,813 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:17,818 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:17,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:17,819 INFO L82 PathProgramCache]: Analyzing trace with hash 836766457, now seen corresponding path program 7 times [2020-10-20 07:06:17,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:17,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730039028] [2020-10-20 07:06:17,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:17,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730039028] [2020-10-20 07:06:17,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700265654] [2020-10-20 07:06:17,966 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:06:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:18,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 07:06:18,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:18,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:06:18,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-10-20 07:06:18,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577029738] [2020-10-20 07:06:18,028 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:06:18,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:18,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 07:06:18,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-20 07:06:18,028 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. cyclomatic complexity: 2 Second operand 10 states. [2020-10-20 07:06:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:18,088 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2020-10-20 07:06:18,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 07:06:18,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 46 transitions. [2020-10-20 07:06:18,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2020-10-20 07:06:18,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 46 transitions. [2020-10-20 07:06:18,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2020-10-20 07:06:18,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-10-20 07:06:18,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 46 transitions. [2020-10-20 07:06:18,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:06:18,091 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-10-20 07:06:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 46 transitions. [2020-10-20 07:06:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-10-20 07:06:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 07:06:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-10-20 07:06:18,095 INFO L714 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-10-20 07:06:18,095 INFO L594 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-10-20 07:06:18,096 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 07:06:18,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 46 transitions. [2020-10-20 07:06:18,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2020-10-20 07:06:18,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:18,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:18,098 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:06:18,098 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 1, 1, 1] [2020-10-20 07:06:18,098 INFO L794 eck$LassoCheckResult]: Stem: 1002#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 997#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 998#L27-3 [2020-10-20 07:06:18,098 INFO L796 eck$LassoCheckResult]: Loop: 998#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1004#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1039#L18 assume !(0 == __VERIFIER_assert_~cond); 1038#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1037#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1003#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 999#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1000#L18 assume !(0 == __VERIFIER_assert_~cond); 1001#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 995#L18-3 assume !(0 == __VERIFIER_assert_~cond); 996#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1036#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1035#L18 assume !(0 == __VERIFIER_assert_~cond); 1034#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1033#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1032#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1031#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1030#L18 assume !(0 == __VERIFIER_assert_~cond); 1029#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1028#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1027#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1026#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1025#L18 assume !(0 == __VERIFIER_assert_~cond); 1024#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1023#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1022#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1021#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1020#L18 assume !(0 == __VERIFIER_assert_~cond); 1019#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1018#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1017#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1016#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1015#L18 assume !(0 == __VERIFIER_assert_~cond); 1014#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1013#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1012#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1011#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1007#L18 assume !(0 == __VERIFIER_assert_~cond); 1010#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1009#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1008#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1006#L28-2 assume !(main_~j~0 < 8); 1005#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 998#L27-3 [2020-10-20 07:06:18,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:18,099 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-10-20 07:06:18,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:18,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953526991] [2020-10-20 07:06:18,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:18,105 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:18,108 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:18,110 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:18,111 INFO L82 PathProgramCache]: Analyzing trace with hash -190546542, now seen corresponding path program 8 times [2020-10-20 07:06:18,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:18,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204386182] [2020-10-20 07:06:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:18,122 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:18,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:18,138 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:18,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:18,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1896379536, now seen corresponding path program 1 times [2020-10-20 07:06:18,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:18,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412092568] [2020-10-20 07:06:18,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:18,152 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:18,163 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:18,169 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:18,707 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 107 [2020-10-20 07:06:18,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:18,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:18,781 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:18,782 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:18,782 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:18,782 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:18,782 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 07:06:18,782 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:18,782 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:18,783 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:18,783 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration9_Loop [2020-10-20 07:06:18,783 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:18,783 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:18,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:18,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:18,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:18,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:18,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:18,908 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:18,908 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:18,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:18,922 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:18,930 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:06:18,931 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:18,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:18,975 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:19,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 07:06:19,030 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,113 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 07:06:19,116 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:19,116 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:19,116 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:19,116 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:19,116 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:06:19,116 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,116 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:19,116 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:19,117 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration9_Loop [2020-10-20 07:06:19,117 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:19,117 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:19,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,199 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:19,205 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:19,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:06:19,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:19,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:19,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:19,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:19,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:19,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:19,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:06:19,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:19,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:19,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:19,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:19,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:19,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:19,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:19,268 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:06:19,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:19,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:19,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:19,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:19,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:19,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:19,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:19,303 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:06:19,311 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-20 07:06:19,311 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,314 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:06:19,314 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 07:06:19,315 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:06:19,315 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nlen~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~nlen~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-20 07:06:19,339 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 07:06:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:19,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:06:19,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:19,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:06:19,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2020-10-20 07:06:19,471 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 07:06:19,474 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 46 transitions. cyclomatic complexity: 2 Second operand 3 states. [2020-10-20 07:06:19,526 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 46 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 88 states and 91 transitions. Complement of second has 4 states. [2020-10-20 07:06:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 07:06:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:06:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-10-20 07:06:19,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 43 letters. [2020-10-20 07:06:19,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:19,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 45 letters. Loop has 43 letters. [2020-10-20 07:06:19,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:19,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 86 letters. [2020-10-20 07:06:19,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:19,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 91 transitions. [2020-10-20 07:06:19,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:06:19,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 87 states and 90 transitions. [2020-10-20 07:06:19,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2020-10-20 07:06:19,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-10-20 07:06:19,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 90 transitions. [2020-10-20 07:06:19,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:06:19,550 INFO L691 BuchiCegarLoop]: Abstraction has 87 states and 90 transitions. [2020-10-20 07:06:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 90 transitions. [2020-10-20 07:06:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2020-10-20 07:06:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-20 07:06:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-10-20 07:06:19,557 INFO L714 BuchiCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-10-20 07:06:19,557 INFO L594 BuchiCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-10-20 07:06:19,557 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 07:06:19,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 54 transitions. [2020-10-20 07:06:19,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:06:19,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:19,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:19,558 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 07:06:19,558 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:06:19,559 INFO L794 eck$LassoCheckResult]: Stem: 1293#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 1283#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1284#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1289#L28-2 [2020-10-20 07:06:19,559 INFO L796 eck$LassoCheckResult]: Loop: 1289#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1290#L18 assume !(0 == __VERIFIER_assert_~cond); 1294#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1285#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1286#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1289#L28-2 [2020-10-20 07:06:19,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:19,560 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2020-10-20 07:06:19,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:19,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065736489] [2020-10-20 07:06:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:19,568 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:19,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:19,579 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:19,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:19,579 INFO L82 PathProgramCache]: Analyzing trace with hash 46241048, now seen corresponding path program 1 times [2020-10-20 07:06:19,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:19,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266432566] [2020-10-20 07:06:19,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:19,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:19,602 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:19,605 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:19,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:19,605 INFO L82 PathProgramCache]: Analyzing trace with hash 271456306, now seen corresponding path program 1 times [2020-10-20 07:06:19,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:19,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452268869] [2020-10-20 07:06:19,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:19,614 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:19,628 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:19,631 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:19,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:19,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:19,701 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:19,701 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:19,701 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:19,701 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:19,701 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 07:06:19,701 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,702 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:19,702 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:19,702 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration10_Loop [2020-10-20 07:06:19,702 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:19,702 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:19,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,764 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:19,764 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:19,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:06:19,774 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:06:19,774 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Honda state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:19,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:06:19,821 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:06:19,821 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:19,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:19,864 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,871 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:06:19,871 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,897 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:19,897 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 07:06:19,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:06:19,965 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 07:06:19,966 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:19,967 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:19,967 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:19,967 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:19,967 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:06:19,967 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,967 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:19,967 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:19,967 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration10_Loop [2020-10-20 07:06:19,967 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:19,967 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:19,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:20,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:20,046 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:20,046 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:06:20,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:20,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:20,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:20,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:20,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:20,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:20,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:20,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:20,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:06:20,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:20,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:20,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:20,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:20,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:20,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:20,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:20,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:06:20,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:20,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:20,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:20,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:20,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:20,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:20,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,160 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:06:20,169 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 07:06:20,169 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,176 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:06:20,177 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 07:06:20,177 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:06:20,177 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 15 Supporting invariants [] [2020-10-20 07:06:20,206 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 07:06:20,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:20,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:06:20,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:20,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:06:20,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:20,247 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 07:06:20,247 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 54 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-10-20 07:06:20,263 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 54 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 138 states and 145 transitions. Complement of second has 7 states. [2020-10-20 07:06:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 07:06:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:06:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-10-20 07:06:20,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 5 letters. [2020-10-20 07:06:20,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:20,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 5 letters. [2020-10-20 07:06:20,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:20,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 10 letters. [2020-10-20 07:06:20,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:20,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 145 transitions. [2020-10-20 07:06:20,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:06:20,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 94 states and 98 transitions. [2020-10-20 07:06:20,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-20 07:06:20,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-10-20 07:06:20,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2020-10-20 07:06:20,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:06:20,271 INFO L691 BuchiCegarLoop]: Abstraction has 94 states and 98 transitions. [2020-10-20 07:06:20,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2020-10-20 07:06:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 51. [2020-10-20 07:06:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-20 07:06:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2020-10-20 07:06:20,275 INFO L714 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-10-20 07:06:20,275 INFO L594 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-10-20 07:06:20,275 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 07:06:20,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 53 transitions. [2020-10-20 07:06:20,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:06:20,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:20,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:20,277 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 2, 1, 1, 1, 1] [2020-10-20 07:06:20,277 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:06:20,278 INFO L794 eck$LassoCheckResult]: Stem: 1532#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 1524#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1525#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1534#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1570#L18 assume !(0 == __VERIFIER_assert_~cond); 1569#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1568#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1533#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1528#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1529#L18 assume !(0 == __VERIFIER_assert_~cond); 1531#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1522#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1523#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1567#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1566#L18 assume !(0 == __VERIFIER_assert_~cond); 1565#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1564#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1563#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1562#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1561#L18 assume !(0 == __VERIFIER_assert_~cond); 1560#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1559#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1558#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1557#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1556#L18 assume !(0 == __VERIFIER_assert_~cond); 1555#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1554#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1553#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1552#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1551#L18 assume !(0 == __VERIFIER_assert_~cond); 1550#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1549#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1548#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1547#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1546#L18 assume !(0 == __VERIFIER_assert_~cond); 1545#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1544#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1543#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1542#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1538#L18 assume !(0 == __VERIFIER_assert_~cond); 1541#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1540#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1539#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1537#L28-2 assume !(main_~j~0 < 8); 1536#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1535#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1526#L28-2 [2020-10-20 07:06:20,278 INFO L796 eck$LassoCheckResult]: Loop: 1526#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1527#L18 assume !(0 == __VERIFIER_assert_~cond); 1530#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1520#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1521#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1526#L28-2 [2020-10-20 07:06:20,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:20,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1341776518, now seen corresponding path program 2 times [2020-10-20 07:06:20,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:20,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103068465] [2020-10-20 07:06:20,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:20,290 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:20,300 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:20,309 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:20,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:20,310 INFO L82 PathProgramCache]: Analyzing trace with hash 46241048, now seen corresponding path program 2 times [2020-10-20 07:06:20,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:20,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839931965] [2020-10-20 07:06:20,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:20,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:20,317 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:20,319 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:20,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:20,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1317012673, now seen corresponding path program 3 times [2020-10-20 07:06:20,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:20,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442788829] [2020-10-20 07:06:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:20,332 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:20,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:20,348 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:20,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:20,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:20,442 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:20,443 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:20,443 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:20,443 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:20,443 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 07:06:20,443 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,443 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:20,443 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:20,444 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration11_Loop [2020-10-20 07:06:20,444 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:20,444 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:20,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:20,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:20,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:20,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:20,508 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:20,508 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:20,513 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:06:20,517 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:06:20,517 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:20,557 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:20,557 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,560 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:06:20,561 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:20,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:20,598 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,602 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:06:20,602 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Honda state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:20,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:20,639 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:20,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 07:06:20,683 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,730 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 07:06:20,732 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:20,733 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:20,733 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:20,733 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:20,733 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:06:20,733 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,733 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:20,733 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:20,733 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration11_Loop [2020-10-20 07:06:20,733 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:20,734 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:20,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:20,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:20,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:20,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-10-20 07:06:20,791 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:20,791 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:20,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:06:20,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:20,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:20,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:20,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:20,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:20,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:20,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,804 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:20,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:06:20,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:20,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:20,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:20,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:20,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:20,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:20,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,847 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:20,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:06:20,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:20,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:20,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:20,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:20,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:20,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:20,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,890 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:20,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:06:20,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:20,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:20,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:20,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:20,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:20,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:20,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,930 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:06:20,933 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 07:06:20,933 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:20,936 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:06:20,936 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 07:06:20,936 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:06:20,936 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 15 Supporting invariants [] Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,972 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 07:06:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:21,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:06:21,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:21,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:06:21,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:21,070 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 07:06:21,071 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-20 07:06:21,086 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 128 states and 133 transitions. Complement of second has 7 states. [2020-10-20 07:06:21,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 07:06:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:06:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-10-20 07:06:21,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 46 letters. Loop has 5 letters. [2020-10-20 07:06:21,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:21,087 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:06:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:21,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:06:21,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:21,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:06:21,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:21,146 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 07:06:21,146 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-20 07:06:21,165 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 128 states and 133 transitions. Complement of second has 7 states. [2020-10-20 07:06:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 07:06:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:06:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-10-20 07:06:21,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 46 letters. Loop has 5 letters. [2020-10-20 07:06:21,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:21,168 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:06:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:21,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:06:21,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:21,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:06:21,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:21,238 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 07:06:21,238 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-20 07:06:21,265 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 90 states and 94 transitions. Complement of second has 6 states. [2020-10-20 07:06:21,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 07:06:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:06:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-10-20 07:06:21,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 46 letters. Loop has 5 letters. [2020-10-20 07:06:21,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:21,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 51 letters. Loop has 5 letters. [2020-10-20 07:06:21,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:21,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 46 letters. Loop has 10 letters. [2020-10-20 07:06:21,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:21,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 94 transitions. [2020-10-20 07:06:21,270 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 07:06:21,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 0 states and 0 transitions. [2020-10-20 07:06:21,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 07:06:21,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 07:06:21,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 07:06:21,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:06:21,271 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:06:21,271 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:06:21,271 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:06:21,271 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 07:06:21,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 07:06:21,271 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 07:06:21,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 07:06:21,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 07:06:21 BoogieIcfgContainer [2020-10-20 07:06:21,278 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 07:06:21,278 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 07:06:21,278 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 07:06:21,279 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 07:06:21,279 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:06:15" (3/4) ... [2020-10-20 07:06:21,282 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 07:06:21,282 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 07:06:21,283 INFO L168 Benchmark]: Toolchain (without parser) took 6172.14 ms. Allocated memory was 43.0 MB in the beginning and 78.1 MB in the end (delta: 35.1 MB). Free memory was 23.8 MB in the beginning and 17.3 MB in the end (delta: 6.4 MB). Peak memory consumption was 41.6 MB. Max. memory is 14.3 GB. [2020-10-20 07:06:21,284 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 32.5 MB. Free memory was 11.1 MB in the beginning and 11.1 MB in the end (delta: 3.1 kB). Peak memory consumption was 3.1 kB. Max. memory is 14.3 GB. [2020-10-20 07:06:21,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.89 ms. Allocated memory was 43.0 MB in the beginning and 43.5 MB in the end (delta: 524.3 kB). Free memory was 23.0 MB in the beginning and 25.4 MB in the end (delta: -2.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 14.3 GB. [2020-10-20 07:06:21,285 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.12 ms. Allocated memory is still 43.5 MB. Free memory was 25.4 MB in the beginning and 23.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 07:06:21,286 INFO L168 Benchmark]: Boogie Preprocessor took 27.60 ms. Allocated memory is still 43.5 MB. Free memory was 23.6 MB in the beginning and 22.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. [2020-10-20 07:06:21,287 INFO L168 Benchmark]: RCFGBuilder took 312.29 ms. Allocated memory is still 43.5 MB. Free memory was 22.3 MB in the beginning and 9.8 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 14.3 GB. [2020-10-20 07:06:21,287 INFO L168 Benchmark]: BuchiAutomizer took 5473.68 ms. Allocated memory was 43.5 MB in the beginning and 78.1 MB in the end (delta: 34.6 MB). Free memory was 9.6 MB in the beginning and 18.2 MB in the end (delta: -8.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 14.3 GB. [2020-10-20 07:06:21,288 INFO L168 Benchmark]: Witness Printer took 3.56 ms. Allocated memory is still 78.1 MB. Free memory was 18.2 MB in the beginning and 17.3 MB in the end (delta: 912.7 kB). Peak memory consumption was 912.7 kB. Max. memory is 14.3 GB. [2020-10-20 07:06:21,292 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 32.5 MB. Free memory was 11.1 MB in the beginning and 11.1 MB in the end (delta: 3.1 kB). Peak memory consumption was 3.1 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 301.89 ms. Allocated memory was 43.0 MB in the beginning and 43.5 MB in the end (delta: 524.3 kB). Free memory was 23.0 MB in the beginning and 25.4 MB in the end (delta: -2.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 41.12 ms. Allocated memory is still 43.5 MB. Free memory was 25.4 MB in the beginning and 23.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 27.60 ms. Allocated memory is still 43.5 MB. Free memory was 23.6 MB in the beginning and 22.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. * RCFGBuilder took 312.29 ms. Allocated memory is still 43.5 MB. Free memory was 22.3 MB in the beginning and 9.8 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 5473.68 ms. Allocated memory was 43.5 MB in the beginning and 78.1 MB in the end (delta: 34.6 MB). Free memory was 9.6 MB in the beginning and 18.2 MB in the end (delta: -8.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 14.3 GB. * Witness Printer took 3.56 ms. Allocated memory is still 78.1 MB. Free memory was 18.2 MB in the beginning and 17.3 MB in the end (delta: 912.7 kB). Peak memory consumption was 912.7 kB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (8 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function nlen + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -2 * j + 15 and consists of 4 locations. One nondeterministic module has affine ranking function -2 * j + 15 and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 12 iterations. TraceHistogramMax:8. Analysis of lassos took 4.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 107 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 51 states and ocurred in iteration 9. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 148/148 HoareTripleCheckerStatistics: 117 SDtfs, 199 SDslu, 195 SDs, 0 SdLazy, 187 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI8 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital26 mio100 ax100 hnf98 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq135 hnf94 smp100 dnf100 smp100 tf112 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...