./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c --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/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -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 58eecb02814a6b78cadd872f0ade36a8b32c0833 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 06:45:59,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:45:59,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:45:59,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:45:59,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:45:59,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:45:59,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:45:59,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:45:59,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:45:59,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:45:59,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:45:59,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:45:59,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:45:59,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:45:59,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:45:59,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:45:59,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:45:59,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:45:59,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:45:59,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:45:59,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:45:59,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:45:59,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:45:59,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:45:59,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:45:59,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:45:59,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:45:59,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:45:59,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:45:59,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:45:59,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:45:59,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:45:59,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:45:59,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:45:59,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:45:59,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:45:59,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:45:59,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:45:59,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:45:59,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:45:59,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:45:59,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 06:45:59,271 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:45:59,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:45:59,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:45:59,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:45:59,276 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:45:59,276 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:45:59,276 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:45:59,277 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:45:59,277 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:45:59,277 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:45:59,277 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:45:59,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:45:59,277 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:45:59,278 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:45:59,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:45:59,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:45:59,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:45:59,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:45:59,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:45:59,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:45:59,280 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:45:59,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:45:59,280 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:45:59,280 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:45:59,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:45:59,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:45:59,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:45:59,282 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:45:59,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:45:59,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:45:59,283 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:45:59,283 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:45:59,284 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:45:59,284 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 -> 58eecb02814a6b78cadd872f0ade36a8b32c0833 [2020-10-20 06:45:59,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:45:59,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:45:59,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:45:59,496 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:45:59,497 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:45:59,498 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2020-10-20 06:45:59,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3416539b/7ae0102570ae41c2998465824d7b793a/FLAG66845d304 [2020-10-20 06:46:00,108 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:46:00,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2020-10-20 06:46:00,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3416539b/7ae0102570ae41c2998465824d7b793a/FLAG66845d304 [2020-10-20 06:46:00,417 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3416539b/7ae0102570ae41c2998465824d7b793a [2020-10-20 06:46:00,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:46:00,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:46:00,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:46:00,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:46:00,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:46:00,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:46:00" (1/1) ... [2020-10-20 06:46:00,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@792229fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:00, skipping insertion in model container [2020-10-20 06:46:00,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:46:00" (1/1) ... [2020-10-20 06:46:00,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:46:00,460 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:46:00,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:46:00,659 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:46:00,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:46:00,695 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:46:00,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:00 WrapperNode [2020-10-20 06:46:00,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:46:00,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:46:00,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:46:00,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:46:00,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:00" (1/1) ... [2020-10-20 06:46:00,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:00" (1/1) ... [2020-10-20 06:46:00,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:46:00,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:46:00,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:46:00,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:46:00,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:00" (1/1) ... [2020-10-20 06:46:00,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:00" (1/1) ... [2020-10-20 06:46:00,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:00" (1/1) ... [2020-10-20 06:46:00,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:00" (1/1) ... [2020-10-20 06:46:00,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:00" (1/1) ... [2020-10-20 06:46:00,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:00" (1/1) ... [2020-10-20 06:46:00,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:00" (1/1) ... [2020-10-20 06:46:00,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:46:00,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:46:00,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:46:00,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:46:00,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:46:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:46:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:46:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:46:00,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:46:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:46:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:46:01,047 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:46:01,048 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-20 06:46:01,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:46:01 BoogieIcfgContainer [2020-10-20 06:46:01,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:46:01,051 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:46:01,051 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:46:01,055 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:46:01,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:46:01,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:46:00" (1/3) ... [2020-10-20 06:46:01,057 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73ee03f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:46:01, skipping insertion in model container [2020-10-20 06:46:01,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:46:01,057 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:00" (2/3) ... [2020-10-20 06:46:01,058 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73ee03f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:46:01, skipping insertion in model container [2020-10-20 06:46:01,058 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:46:01,058 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:46:01" (3/3) ... [2020-10-20 06:46:01,060 INFO L373 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2020-10-20 06:46:01,117 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:46:01,118 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:46:01,118 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:46:01,118 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:46:01,118 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:46:01,118 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:46:01,119 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:46:01,119 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:46:01,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-10-20 06:46:01,161 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-10-20 06:46:01,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:01,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:01,172 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:46:01,172 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:46:01,173 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:46:01,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-10-20 06:46:01,174 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-10-20 06:46:01,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:01,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:01,175 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:46:01,175 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:46:01,184 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 11#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 7#L21-3true [2020-10-20 06:46:01,185 INFO L796 eck$LassoCheckResult]: Loop: 7#L21-3true assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 9#L21-2true main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 7#L21-3true [2020-10-20 06:46:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:01,191 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:46:01,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:01,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882102361] [2020-10-20 06:46:01,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:01,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:01,322 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:01,356 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:01,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:01,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-20 06:46:01,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:01,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692407939] [2020-10-20 06:46:01,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:01,367 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:01,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:01,376 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:01,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:01,378 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-20 06:46:01,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:01,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920572264] [2020-10-20 06:46:01,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:01,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:01,428 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:01,440 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:01,753 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2020-10-20 06:46:01,878 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-20 06:46:01,891 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:01,892 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:01,892 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:01,892 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:01,893 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:46:01,893 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:01,893 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:01,893 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:01,894 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration1_Lasso [2020-10-20 06:46:01,894 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:01,894 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:01,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:01,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:01,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:01,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:01,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:01,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:01,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:01,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:01,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:01,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:01,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:01,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:02,163 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2020-10-20 06:46:02,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:02,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:02,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:02,495 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:02,500 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:02,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:02,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:02,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:02,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:02,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:02,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:02,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:02,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:02,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:02,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:02,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:02,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:02,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:02,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:02,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:02,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:02,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:02,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:02,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:02,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:02,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:02,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:02,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:02,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:02,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:02,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:02,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:02,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:02,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:02,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:02,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:02,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:02,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:02,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:02,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:02,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:02,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:02,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:02,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:02,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:02,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:02,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:02,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:02,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:02,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:02,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:02,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:02,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:02,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:02,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:02,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:02,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:02,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:02,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:02,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:02,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:02,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:02,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:02,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:02,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:02,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:02,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:02,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:02,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:02,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:02,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:02,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:02,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:02,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:02,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:02,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:02,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:02,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:02,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:02,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:02,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:02,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:02,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:02,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:02,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:02,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:02,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:02,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:02,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:02,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:02,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:02,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:02,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:02,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:02,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:02,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:02,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:02,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:02,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:02,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:02,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:02,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:03,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:03,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:03,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:03,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:03,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:03,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:03,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:46:03,046 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) [2020-10-20 06:46:03,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:03,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:03,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:03,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:03,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:03,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:03,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:03,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:03,098 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 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 06:46:03,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:03,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:03,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:03,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:03,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:03,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:03,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:46:03,145 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:03,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:03,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:03,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:03,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:03,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:03,192 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:03,192 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:03,199 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 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 06:46:03,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:03,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:03,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:03,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:03,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:03,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:03,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:46:03,236 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 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:03,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:03,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:03,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:03,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:03,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:03,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:03,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:46:03,274 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:03,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:03,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:03,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:03,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:03,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:03,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:03,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:46:03,317 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:46:03,483 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-20 06:46:03,483 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 06:46:03,495 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:46:03,498 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:46:03,499 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:46:03,499 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#in~0.base)_1, ULTIMATE.start_main_~i~0) = 21*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_1 - 2*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-20 06:46:03,572 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 06:46:03,583 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:46:03,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:03,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:03,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:03,707 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:46:03,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:03,780 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:46:03,782 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2020-10-20 06:46:03,858 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 27 states and 37 transitions. Complement of second has 8 states. [2020-10-20 06:46:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:46:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:46:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-10-20 06:46:03,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-20 06:46:03,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:03,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-20 06:46:03,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:03,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-20 06:46:03,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:03,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. [2020-10-20 06:46:03,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:03,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 7 states and 9 transitions. [2020-10-20 06:46:03,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-10-20 06:46:03,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-10-20 06:46:03,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2020-10-20 06:46:03,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:46:03,883 INFO L691 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-10-20 06:46:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2020-10-20 06:46:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-10-20 06:46:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-20 06:46:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-10-20 06:46:03,912 INFO L714 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-10-20 06:46:03,912 INFO L594 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-10-20 06:46:03,912 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:46:03,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-10-20 06:46:03,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:03,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:03,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:03,914 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:46:03,914 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 06:46:03,914 INFO L794 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 125#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 126#L21-3 assume !(main_~i~0 < 11); 129#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 127#L28-2 [2020-10-20 06:46:03,914 INFO L796 eck$LassoCheckResult]: Loop: 127#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 127#L28-2 [2020-10-20 06:46:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-10-20 06:46:03,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:03,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841514743] [2020-10-20 06:46:03,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:03,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841514743] [2020-10-20 06:46:03,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:03,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:03,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097626432] [2020-10-20 06:46:03,976 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:03,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:03,977 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2020-10-20 06:46:03,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:03,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255534237] [2020-10-20 06:46:03,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:03,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:04,006 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:04,009 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:04,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:04,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:04,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:04,134 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-20 06:46:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:04,156 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-10-20 06:46:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:04,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2020-10-20 06:46:04,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:04,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2020-10-20 06:46:04,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:46:04,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:46:04,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2020-10-20 06:46:04,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:46:04,160 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-20 06:46:04,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2020-10-20 06:46:04,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2020-10-20 06:46:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-20 06:46:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2020-10-20 06:46:04,163 INFO L714 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-10-20 06:46:04,163 INFO L594 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-10-20 06:46:04,163 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:46:04,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-10-20 06:46:04,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:04,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:04,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:04,164 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:46:04,165 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 06:46:04,165 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 147#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 148#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 152#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 153#L21-3 assume !(main_~i~0 < 11); 151#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 149#L28-2 [2020-10-20 06:46:04,165 INFO L796 eck$LassoCheckResult]: Loop: 149#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 149#L28-2 [2020-10-20 06:46:04,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-10-20 06:46:04,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:04,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420321815] [2020-10-20 06:46:04,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:04,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420321815] [2020-10-20 06:46:04,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692823760] [2020-10-20 06:46:04,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:46:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:04,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 06:46:04,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:04,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:46:04,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-20 06:46:04,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615502713] [2020-10-20 06:46:04,297 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:04,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2020-10-20 06:46:04,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:04,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332623779] [2020-10-20 06:46:04,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:04,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:04,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:04,317 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:04,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:04,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:46:04,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:46:04,408 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 5 states. [2020-10-20 06:46:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:04,432 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-10-20 06:46:04,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:46:04,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-10-20 06:46:04,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:04,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2020-10-20 06:46:04,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:46:04,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:46:04,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-10-20 06:46:04,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:46:04,434 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-20 06:46:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-10-20 06:46:04,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2020-10-20 06:46:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-20 06:46:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-10-20 06:46:04,436 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-20 06:46:04,436 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-20 06:46:04,436 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:46:04,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-10-20 06:46:04,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:04,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:04,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:04,437 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-20 06:46:04,438 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 06:46:04,438 INFO L794 eck$LassoCheckResult]: Stem: 191#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 188#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 189#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 193#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 194#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 195#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 196#L21-3 assume !(main_~i~0 < 11); 192#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 190#L28-2 [2020-10-20 06:46:04,438 INFO L796 eck$LassoCheckResult]: Loop: 190#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 190#L28-2 [2020-10-20 06:46:04,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:04,438 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-10-20 06:46:04,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:04,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840952386] [2020-10-20 06:46:04,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:04,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840952386] [2020-10-20 06:46:04,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708177514] [2020-10-20 06:46:04,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:46:04,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:46:04,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:46:04,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:04,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:04,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:46:04,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 06:46:04,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408014804] [2020-10-20 06:46:04,583 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:04,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:04,583 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2020-10-20 06:46:04,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:04,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773305919] [2020-10-20 06:46:04,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:04,591 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:04,597 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:04,599 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:04,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:04,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 06:46:04,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 06:46:04,666 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 6 states. [2020-10-20 06:46:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:04,690 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-10-20 06:46:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:46:04,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2020-10-20 06:46:04,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:04,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2020-10-20 06:46:04,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:46:04,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:46:04,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2020-10-20 06:46:04,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:46:04,693 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-20 06:46:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2020-10-20 06:46:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2020-10-20 06:46:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-20 06:46:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-10-20 06:46:04,695 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-20 06:46:04,695 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-20 06:46:04,695 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:46:04,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-10-20 06:46:04,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:04,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:04,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:04,696 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-10-20 06:46:04,697 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 06:46:04,697 INFO L794 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 240#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 241#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 245#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 246#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 247#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 248#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 250#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 249#L21-3 assume !(main_~i~0 < 11); 244#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 242#L28-2 [2020-10-20 06:46:04,697 INFO L796 eck$LassoCheckResult]: Loop: 242#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 242#L28-2 [2020-10-20 06:46:04,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:04,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-10-20 06:46:04,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:04,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637996428] [2020-10-20 06:46:04,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:04,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637996428] [2020-10-20 06:46:04,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296781704] [2020-10-20 06:46:04,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:46:04,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 06:46:04,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:46:04,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:46:04,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:04,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:46:04,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 06:46:04,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481083964] [2020-10-20 06:46:04,835 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:04,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:04,835 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2020-10-20 06:46:04,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:04,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080395039] [2020-10-20 06:46:04,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:04,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:04,860 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:04,862 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:04,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:04,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:46:04,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:46:04,936 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 7 states. [2020-10-20 06:46:04,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:04,961 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-10-20 06:46:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:46:04,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2020-10-20 06:46:04,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:04,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2020-10-20 06:46:04,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:46:04,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:46:04,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2020-10-20 06:46:04,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:46:04,964 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-20 06:46:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2020-10-20 06:46:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-10-20 06:46:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-20 06:46:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-10-20 06:46:04,966 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-20 06:46:04,966 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-20 06:46:04,966 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:46:04,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2020-10-20 06:46:04,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:04,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:04,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:04,967 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-10-20 06:46:04,967 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 06:46:04,968 INFO L794 eck$LassoCheckResult]: Stem: 306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 303#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 304#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 308#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 309#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 310#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 315#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 314#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 313#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 312#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 311#L21-3 assume !(main_~i~0 < 11); 307#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 305#L28-2 [2020-10-20 06:46:04,968 INFO L796 eck$LassoCheckResult]: Loop: 305#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 305#L28-2 [2020-10-20 06:46:04,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:04,968 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-10-20 06:46:04,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:04,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221824246] [2020-10-20 06:46:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:05,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221824246] [2020-10-20 06:46:05,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856072125] [2020-10-20 06:46:05,037 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:46:05,075 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:46:05,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:46:05,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:46:05,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:05,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:46:05,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-20 06:46:05,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772953918] [2020-10-20 06:46:05,114 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:05,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:05,114 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 5 times [2020-10-20 06:46:05,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:05,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607318411] [2020-10-20 06:46:05,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:05,128 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:05,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:05,143 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:05,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:05,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:46:05,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:46:05,222 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 8 states. [2020-10-20 06:46:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:05,261 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-10-20 06:46:05,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 06:46:05,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2020-10-20 06:46:05,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:05,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2020-10-20 06:46:05,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:46:05,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:46:05,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2020-10-20 06:46:05,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:46:05,266 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-10-20 06:46:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2020-10-20 06:46:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2020-10-20 06:46:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 06:46:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-10-20 06:46:05,268 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-20 06:46:05,269 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-20 06:46:05,269 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:46:05,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-10-20 06:46:05,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:05,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:05,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:05,271 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-10-20 06:46:05,271 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 06:46:05,272 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 377#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 378#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 382#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 383#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 384#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 391#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 390#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 389#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 388#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 387#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 386#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 385#L21-3 assume !(main_~i~0 < 11); 381#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 379#L28-2 [2020-10-20 06:46:05,272 INFO L796 eck$LassoCheckResult]: Loop: 379#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 379#L28-2 [2020-10-20 06:46:05,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:05,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-10-20 06:46:05,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:05,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476288084] [2020-10-20 06:46:05,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:05,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476288084] [2020-10-20 06:46:05,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381746932] [2020-10-20 06:46:05,380 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:46:05,420 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-20 06:46:05,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:46:05,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:46:05,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:05,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:46:05,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-20 06:46:05,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093614751] [2020-10-20 06:46:05,445 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:05,445 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 6 times [2020-10-20 06:46:05,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:05,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31519603] [2020-10-20 06:46:05,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:05,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:05,455 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:05,457 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:05,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:05,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:46:05,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:46:05,534 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 9 states. [2020-10-20 06:46:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:05,569 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-10-20 06:46:05,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:46:05,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2020-10-20 06:46:05,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:05,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2020-10-20 06:46:05,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:46:05,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:46:05,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2020-10-20 06:46:05,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:46:05,572 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-10-20 06:46:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2020-10-20 06:46:05,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-10-20 06:46:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 06:46:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-10-20 06:46:05,574 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-10-20 06:46:05,574 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-10-20 06:46:05,574 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:46:05,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2020-10-20 06:46:05,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:05,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:05,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:05,576 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2020-10-20 06:46:05,576 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 06:46:05,576 INFO L794 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 462#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 463#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 467#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 468#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 469#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 478#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 477#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 476#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 475#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 474#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 473#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 472#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 471#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 470#L21-3 assume !(main_~i~0 < 11); 466#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 464#L28-2 [2020-10-20 06:46:05,576 INFO L796 eck$LassoCheckResult]: Loop: 464#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 464#L28-2 [2020-10-20 06:46:05,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:05,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2020-10-20 06:46:05,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:05,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300486631] [2020-10-20 06:46:05,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:05,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300486631] [2020-10-20 06:46:05,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655956581] [2020-10-20 06:46:05,653 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:46:05,717 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-20 06:46:05,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:46:05,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:46:05,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:05,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:46:05,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-20 06:46:05,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823124970] [2020-10-20 06:46:05,748 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:05,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:05,748 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 7 times [2020-10-20 06:46:05,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:05,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032376082] [2020-10-20 06:46:05,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:05,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:05,758 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:05,759 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:05,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:05,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:46:05,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:46:05,835 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 10 states. [2020-10-20 06:46:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:05,875 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-10-20 06:46:05,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:46:05,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2020-10-20 06:46:05,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:05,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2020-10-20 06:46:05,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:46:05,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:46:05,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2020-10-20 06:46:05,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:46:05,892 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-10-20 06:46:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2020-10-20 06:46:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-10-20 06:46:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-20 06:46:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-10-20 06:46:05,895 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-10-20 06:46:05,895 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-10-20 06:46:05,895 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:46:05,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2020-10-20 06:46:05,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:05,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:05,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:05,896 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2020-10-20 06:46:05,896 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 06:46:05,897 INFO L794 eck$LassoCheckResult]: Stem: 561#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 558#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 559#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 563#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 564#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 565#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 576#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 575#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 574#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 573#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 572#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 571#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 570#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 569#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 568#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 567#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 566#L21-3 assume !(main_~i~0 < 11); 562#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 560#L28-2 [2020-10-20 06:46:05,897 INFO L796 eck$LassoCheckResult]: Loop: 560#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 560#L28-2 [2020-10-20 06:46:05,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:05,897 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2020-10-20 06:46:05,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:05,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769488636] [2020-10-20 06:46:05,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:05,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769488636] [2020-10-20 06:46:05,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355748472] [2020-10-20 06:46:05,974 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:46:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:06,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:46:06,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:06,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:46:06,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-20 06:46:06,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806110989] [2020-10-20 06:46:06,041 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:06,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:06,041 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 8 times [2020-10-20 06:46:06,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:06,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017604923] [2020-10-20 06:46:06,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:06,046 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:06,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:06,052 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:06,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:06,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:46:06,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:46:06,115 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 11 states. [2020-10-20 06:46:06,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:06,176 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-10-20 06:46:06,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:46:06,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2020-10-20 06:46:06,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:06,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2020-10-20 06:46:06,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:46:06,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:46:06,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2020-10-20 06:46:06,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:46:06,179 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-10-20 06:46:06,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2020-10-20 06:46:06,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-10-20 06:46:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-20 06:46:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-10-20 06:46:06,183 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-10-20 06:46:06,183 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-10-20 06:46:06,183 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:46:06,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2020-10-20 06:46:06,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:06,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:06,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:06,185 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2020-10-20 06:46:06,185 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 06:46:06,185 INFO L794 eck$LassoCheckResult]: Stem: 668#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 665#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 666#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 670#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 671#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 672#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 685#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 684#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 683#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 682#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 681#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 680#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 679#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 678#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 677#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 676#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 675#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 674#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 673#L21-3 assume !(main_~i~0 < 11); 669#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 667#L28-2 [2020-10-20 06:46:06,185 INFO L796 eck$LassoCheckResult]: Loop: 667#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 667#L28-2 [2020-10-20 06:46:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:06,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2020-10-20 06:46:06,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:06,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907141048] [2020-10-20 06:46:06,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:06,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907141048] [2020-10-20 06:46:06,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497956389] [2020-10-20 06:46:06,268 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:46:06,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:46:06,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:46:06,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:46:06,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:06,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:46:06,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-20 06:46:06,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49500907] [2020-10-20 06:46:06,337 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:06,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:06,338 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 9 times [2020-10-20 06:46:06,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:06,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470461774] [2020-10-20 06:46:06,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:06,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:06,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:06,348 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:06,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:06,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:46:06,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:46:06,429 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 12 states. [2020-10-20 06:46:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:06,484 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-10-20 06:46:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:46:06,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2020-10-20 06:46:06,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:06,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2020-10-20 06:46:06,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:46:06,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:46:06,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2020-10-20 06:46:06,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:46:06,486 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-10-20 06:46:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2020-10-20 06:46:06,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-10-20 06:46:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-20 06:46:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-10-20 06:46:06,489 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-10-20 06:46:06,489 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-10-20 06:46:06,489 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:46:06,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2020-10-20 06:46:06,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:06,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:06,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:06,492 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2020-10-20 06:46:06,492 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 06:46:06,493 INFO L794 eck$LassoCheckResult]: Stem: 786#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 783#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 784#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 788#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 789#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 790#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 805#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 804#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 803#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 802#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 801#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 800#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 799#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 798#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 797#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 796#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 795#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 794#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 793#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 792#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 791#L21-3 assume !(main_~i~0 < 11); 787#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 785#L28-2 [2020-10-20 06:46:06,493 INFO L796 eck$LassoCheckResult]: Loop: 785#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 785#L28-2 [2020-10-20 06:46:06,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:06,493 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2020-10-20 06:46:06,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:06,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803373690] [2020-10-20 06:46:06,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:06,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803373690] [2020-10-20 06:46:06,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310045390] [2020-10-20 06:46:06,613 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:46:06,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-10-20 06:46:06,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:46:06,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:46:06,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:06,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:46:06,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-10-20 06:46:06,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620413357] [2020-10-20 06:46:06,814 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:06,816 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 10 times [2020-10-20 06:46:06,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:06,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874380126] [2020-10-20 06:46:06,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:06,829 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:06,838 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:06,840 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:06,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:06,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 06:46:06,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:46:06,916 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 13 states. [2020-10-20 06:46:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:06,975 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-10-20 06:46:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:46:06,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2020-10-20 06:46:06,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:06,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2020-10-20 06:46:06,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-20 06:46:06,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-20 06:46:06,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2020-10-20 06:46:06,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:46:06,981 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-10-20 06:46:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2020-10-20 06:46:06,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2020-10-20 06:46:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-20 06:46:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-10-20 06:46:06,983 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-10-20 06:46:06,986 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-10-20 06:46:06,986 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 06:46:06,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2020-10-20 06:46:06,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:06,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:06,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:06,990 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2020-10-20 06:46:06,992 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 06:46:06,992 INFO L794 eck$LassoCheckResult]: Stem: 916#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 913#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 914#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 918#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 919#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 920#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 921#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 937#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 936#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 935#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 934#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 933#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 932#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 931#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 930#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 929#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 928#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 927#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 926#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 925#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 924#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 923#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 922#L21-3 assume !(main_~i~0 < 11); 917#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 915#L28-2 [2020-10-20 06:46:06,992 INFO L796 eck$LassoCheckResult]: Loop: 915#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 915#L28-2 [2020-10-20 06:46:06,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:06,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2020-10-20 06:46:06,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:06,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608189074] [2020-10-20 06:46:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:07,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608189074] [2020-10-20 06:46:07,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506278168] [2020-10-20 06:46:07,109 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:46:07,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:46:07,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:46:07,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 06:46:07,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:07,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:46:07,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2020-10-20 06:46:07,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124306235] [2020-10-20 06:46:07,214 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:07,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:07,214 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 11 times [2020-10-20 06:46:07,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:07,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082453531] [2020-10-20 06:46:07,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:07,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:07,224 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:07,226 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:07,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:07,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 06:46:07,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2020-10-20 06:46:07,298 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 14 states. [2020-10-20 06:46:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:07,359 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-10-20 06:46:07,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 06:46:07,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2020-10-20 06:46:07,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:07,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2020-10-20 06:46:07,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-20 06:46:07,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-20 06:46:07,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2020-10-20 06:46:07,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:46:07,363 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-10-20 06:46:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2020-10-20 06:46:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-10-20 06:46:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 06:46:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-10-20 06:46:07,366 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-10-20 06:46:07,367 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-10-20 06:46:07,367 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 06:46:07,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2020-10-20 06:46:07,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-20 06:46:07,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:07,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:07,368 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1] [2020-10-20 06:46:07,369 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 06:46:07,369 INFO L794 eck$LassoCheckResult]: Stem: 1056#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1053#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 1054#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1058#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1059#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1060#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1061#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1079#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1078#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1077#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1076#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1075#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1074#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1073#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1072#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1071#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1070#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1069#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1068#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1067#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1066#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1065#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1064#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1063#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1062#L21-3 assume !(main_~i~0 < 11); 1057#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 1055#L28-2 [2020-10-20 06:46:07,369 INFO L796 eck$LassoCheckResult]: Loop: 1055#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 1055#L28-2 [2020-10-20 06:46:07,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:07,370 INFO L82 PathProgramCache]: Analyzing trace with hash -95647583, now seen corresponding path program 11 times [2020-10-20 06:46:07,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:07,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079320031] [2020-10-20 06:46:07,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:07,387 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:07,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:07,409 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:07,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:07,409 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 12 times [2020-10-20 06:46:07,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:07,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958053443] [2020-10-20 06:46:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:07,414 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:07,417 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:07,419 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:07,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:07,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1329892248, now seen corresponding path program 1 times [2020-10-20 06:46:07,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:07,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566830475] [2020-10-20 06:46:07,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:07,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:07,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:07,479 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:18,389 WARN L193 SmtUtils]: Spent 10.83 s on a formula simplification. DAG size of input: 259 DAG size of output: 197 [2020-10-20 06:46:19,216 WARN L193 SmtUtils]: Spent 799.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-20 06:46:19,219 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:19,219 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:19,219 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:19,220 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:19,220 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:46:19,220 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:19,220 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:19,220 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:19,220 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration13_Lasso [2020-10-20 06:46:19,220 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:19,221 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:19,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:19,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:19,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:19,615 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-10-20 06:46:19,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:19,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:19,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:19,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:19,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 06:46:19,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:19,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:19,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:19,985 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-10-20 06:46:20,345 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2020-10-20 06:46:20,384 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:20,385 INFO L489 LassoAnalysis]: Using template 'affine'. 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 06:46:20,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:20,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:20,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:20,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:20,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:20,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:20,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:46:20,405 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 06:46:20,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:20,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:20,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:20,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:20,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:20,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:20,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:20,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:20,438 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) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:20,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:20,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:20,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:20,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:20,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:20,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:20,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:46:20,465 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:20,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:20,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:20,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:20,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:20,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:20,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:20,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:46:20,493 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:20,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:20,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:20,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:20,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:20,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:20,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:20,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:46:20,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:20,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:20,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:20,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:20,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:20,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:20,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:20,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:20,569 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:20,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:20,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:20,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:20,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:20,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:20,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:20,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:20,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:20,594 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 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:20,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:20,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:20,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:20,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:20,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:20,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:20,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:46:20,623 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:20,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:20,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:20,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:20,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:20,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:20,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:20,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:20,661 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:20,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:20,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:20,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:20,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:20,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:20,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:20,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:20,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:20,694 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 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:20,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:20,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:20,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:20,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:20,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:20,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:20,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:46:20,745 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 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:20,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:46:20,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:20,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:20,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:20,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:20,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:46:20,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:46:20,781 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:46:20,802 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-20 06:46:20,802 INFO L444 ModelExtractionUtils]: 9 out of 19 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:20,805 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:46:20,807 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:46:20,808 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:46:20,808 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#in~0.offset, ULTIMATE.start_main_~idx_in~0, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2) = -1*ULTIMATE.start_main_~#in~0.offset - 1*ULTIMATE.start_main_~idx_in~0 + 1*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2 Supporting invariants [] [2020-10-20 06:46:20,868 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 06:46:20,870 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:46:20,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:20,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:20,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:20,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:20,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:20,923 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-10-20 06:46:20,924 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 2 states. [2020-10-20 06:46:20,930 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3. Second operand 2 states. Result 28 states and 29 transitions. Complement of second has 2 states. [2020-10-20 06:46:20,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2020-10-20 06:46:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-10-20 06:46:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2020-10-20 06:46:20,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 1 letters. [2020-10-20 06:46:20,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:20,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 27 letters. Loop has 1 letters. [2020-10-20 06:46:20,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:20,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2020-10-20 06:46:20,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:20,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2020-10-20 06:46:20,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:46:20,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2020-10-20 06:46:20,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:46:20,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:46:20,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:46:20,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:46:20,936 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:46:20,936 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:46:20,936 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:46:20,936 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 06:46:20,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:46:20,937 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:46:20,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:46:20,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:46:20 BoogieIcfgContainer [2020-10-20 06:46:20,942 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:46:20,943 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:46:20,943 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:46:20,943 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:46:20,944 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:46:01" (3/4) ... [2020-10-20 06:46:20,947 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:46:20,947 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:46:20,949 INFO L168 Benchmark]: Toolchain (without parser) took 20527.39 ms. Allocated memory was 41.9 MB in the beginning and 83.4 MB in the end (delta: 41.4 MB). Free memory was 22.5 MB in the beginning and 33.2 MB in the end (delta: -10.8 MB). Peak memory consumption was 30.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:46:20,949 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 32.0 MB. Free memory was 10.4 MB in the beginning and 10.3 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. [2020-10-20 06:46:20,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.73 ms. Allocated memory was 41.9 MB in the beginning and 42.5 MB in the end (delta: 524.3 kB). Free memory was 21.5 MB in the beginning and 23.5 MB in the end (delta: -1.9 MB). Peak memory consumption was 12.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:46:20,951 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.10 ms. Allocated memory is still 42.5 MB. Free memory was 23.5 MB in the beginning and 21.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:46:20,951 INFO L168 Benchmark]: Boogie Preprocessor took 23.34 ms. Allocated memory is still 42.5 MB. Free memory was 21.7 MB in the beginning and 20.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:46:20,952 INFO L168 Benchmark]: RCFGBuilder took 293.42 ms. Allocated memory was 42.5 MB in the beginning and 44.0 MB in the end (delta: 1.6 MB). Free memory was 20.2 MB in the beginning and 23.2 MB in the end (delta: -2.9 MB). Peak memory consumption was 10.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:46:20,953 INFO L168 Benchmark]: BuchiAutomizer took 19891.83 ms. Allocated memory was 44.0 MB in the beginning and 83.4 MB in the end (delta: 39.3 MB). Free memory was 23.2 MB in the beginning and 33.2 MB in the end (delta: -10.0 MB). Peak memory consumption was 29.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:46:20,953 INFO L168 Benchmark]: Witness Printer took 4.47 ms. Allocated memory is still 83.4 MB. Free memory is still 33.2 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 06:46:20,956 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.28 ms. Allocated memory is still 32.0 MB. Free memory was 10.4 MB in the beginning and 10.3 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 269.73 ms. Allocated memory was 41.9 MB in the beginning and 42.5 MB in the end (delta: 524.3 kB). Free memory was 21.5 MB in the beginning and 23.5 MB in the end (delta: -1.9 MB). Peak memory consumption was 12.3 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 36.10 ms. Allocated memory is still 42.5 MB. Free memory was 23.5 MB in the beginning and 21.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 23.34 ms. Allocated memory is still 42.5 MB. Free memory was 21.7 MB in the beginning and 20.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 293.42 ms. Allocated memory was 42.5 MB in the beginning and 44.0 MB in the end (delta: 1.6 MB). Free memory was 20.2 MB in the beginning and 23.2 MB in the end (delta: -2.9 MB). Peak memory consumption was 10.8 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 19891.83 ms. Allocated memory was 44.0 MB in the beginning and 83.4 MB in the end (delta: 39.3 MB). Free memory was 23.2 MB in the beginning and 33.2 MB in the end (delta: -10.0 MB). Peak memory consumption was 29.3 MB. Max. memory is 14.3 GB. * Witness Printer took 4.47 ms. Allocated memory is still 83.4 MB. Free memory is still 33.2 MB. There was no memory consumed. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 21 * unknown-#length-unknown[in] + -2 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * in + -1 * idx_in + unknown-#length-unknown[in] and consists of 2 locations. 11 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.8s and 14 iterations. TraceHistogramMax:11. Analysis of lassos took 18.7s. Construction of modules took 0.3s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 23 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 12. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 52 SDtfs, 73 SDslu, 48 SDs, 0 SdLazy, 277 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital249 mio100 ax100 hnf99 lsp100 ukn48 mio100 lsp42 div141 bol100 ite100 ukn100 eq161 hnf74 smp97 dnf202 smp75 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...