./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 f6fb2bb1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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 860b8b475b7671f4fb04d10fe02f66a14a39a96b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 19:57:12,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 19:57:12,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 19:57:12,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 19:57:12,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 19:57:12,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 19:57:12,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 19:57:12,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 19:57:12,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 19:57:12,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 19:57:12,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 19:57:12,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 19:57:12,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 19:57:12,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 19:57:12,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 19:57:12,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 19:57:12,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 19:57:12,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 19:57:12,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 19:57:12,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 19:57:12,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 19:57:12,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 19:57:12,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 19:57:12,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 19:57:12,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 19:57:12,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 19:57:12,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 19:57:12,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 19:57:12,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 19:57:12,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 19:57:12,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 19:57:12,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 19:57:12,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 19:57:12,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 19:57:12,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 19:57:12,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 19:57:12,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 19:57:12,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 19:57:12,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 19:57:12,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 19:57:12,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 19:57:12,742 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-19 19:57:12,779 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 19:57:12,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 19:57:12,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 19:57:12,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 19:57:12,788 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 19:57:12,789 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 19:57:12,789 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 19:57:12,789 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 19:57:12,789 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 19:57:12,790 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 19:57:12,790 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 19:57:12,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 19:57:12,792 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 19:57:12,792 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 19:57:12,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 19:57:12,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 19:57:12,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 19:57:12,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 19:57:12,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 19:57:12,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 19:57:12,794 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 19:57:12,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 19:57:12,795 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 19:57:12,795 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 19:57:12,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 19:57:12,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 19:57:12,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 19:57:12,797 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 19:57:12,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 19:57:12,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 19:57:12,798 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 19:57:12,800 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 19:57:12,802 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 -> 860b8b475b7671f4fb04d10fe02f66a14a39a96b [2019-11-19 19:57:13,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 19:57:13,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 19:57:13,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 19:57:13,159 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 19:57:13,159 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 19:57:13,160 INFO L428 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 [2019-11-19 19:57:13,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5133d5512/142cc80cf20b460286f33a4a0cfa1f82/FLAG754b9bef5 [2019-11-19 19:57:13,688 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 19:57:13,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2019-11-19 19:57:13,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5133d5512/142cc80cf20b460286f33a4a0cfa1f82/FLAG754b9bef5 [2019-11-19 19:57:14,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5133d5512/142cc80cf20b460286f33a4a0cfa1f82 [2019-11-19 19:57:14,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 19:57:14,050 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 19:57:14,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 19:57:14,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 19:57:14,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 19:57:14,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:57:14" (1/1) ... [2019-11-19 19:57:14,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa7ba6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:14, skipping insertion in model container [2019-11-19 19:57:14,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:57:14" (1/1) ... [2019-11-19 19:57:14,064 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 19:57:14,082 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 19:57:14,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:57:14,273 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 19:57:14,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:57:14,309 INFO L192 MainTranslator]: Completed translation [2019-11-19 19:57:14,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:14 WrapperNode [2019-11-19 19:57:14,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 19:57:14,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 19:57:14,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 19:57:14,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 19:57:14,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:14" (1/1) ... [2019-11-19 19:57:14,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:14" (1/1) ... [2019-11-19 19:57:14,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 19:57:14,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 19:57:14,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 19:57:14,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 19:57:14,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:14" (1/1) ... [2019-11-19 19:57:14,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:14" (1/1) ... [2019-11-19 19:57:14,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:14" (1/1) ... [2019-11-19 19:57:14,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:14" (1/1) ... [2019-11-19 19:57:14,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:14" (1/1) ... [2019-11-19 19:57:14,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:14" (1/1) ... [2019-11-19 19:57:14,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:14" (1/1) ... [2019-11-19 19:57:14,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 19:57:14,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 19:57:14,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 19:57:14,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 19:57:14,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:57:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 19:57:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 19:57:14,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 19:57:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 19:57:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 19:57:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 19:57:14,718 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 19:57:14,719 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-19 19:57:14,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:57:14 BoogieIcfgContainer [2019-11-19 19:57:14,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 19:57:14,721 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 19:57:14,721 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 19:57:14,725 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 19:57:14,726 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 19:57:14,726 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 07:57:14" (1/3) ... [2019-11-19 19:57:14,727 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a85a1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:57:14, skipping insertion in model container [2019-11-19 19:57:14,728 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 19:57:14,728 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:14" (2/3) ... [2019-11-19 19:57:14,728 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a85a1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:57:14, skipping insertion in model container [2019-11-19 19:57:14,728 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 19:57:14,728 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:57:14" (3/3) ... [2019-11-19 19:57:14,730 INFO L371 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2019-11-19 19:57:14,786 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 19:57:14,786 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 19:57:14,786 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 19:57:14,786 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 19:57:14,787 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 19:57:14,787 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 19:57:14,787 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 19:57:14,787 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 19:57:14,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-19 19:57:14,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-11-19 19:57:14,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:57:14,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:57:14,826 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 19:57:14,826 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 19:57:14,826 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 19:57:14,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-19 19:57:14,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-11-19 19:57:14,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:57:14,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:57:14,829 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 19:57:14,829 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 19:57:14,836 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, 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; 4#L19-3true [2019-11-19 19:57:14,836 INFO L796 eck$LassoCheckResult]: Loop: 4#L19-3true assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 6#L19-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 4#L19-3true [2019-11-19 19:57:14,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:14,842 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-19 19:57:14,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:14,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644244992] [2019-11-19 19:57:14,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:14,989 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:14,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:14,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-19 19:57:14,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:14,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821301036] [2019-11-19 19:57:14,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:15,017 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:15,021 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-19 19:57:15,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:15,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055480861] [2019-11-19 19:57:15,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:15,098 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:15,264 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 19:57:15,265 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 19:57:15,265 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 19:57:15,265 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 19:57:15,265 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 19:57:15,265 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:57:15,266 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 19:57:15,266 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 19:57:15,266 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration1_Lasso [2019-11-19 19:57:15,266 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 19:57:15,266 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 19:57:15,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:57:15,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:57:15,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:57:15,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:57:15,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:57:15,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:57:15,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:57:15,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:57:15,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:57:15,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:57:15,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:57:15,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:57:15,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:57:15,609 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 19:57:15,615 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) [2019-11-19 19:57:15,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:57:15,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:57:15,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:57:15,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:57:15,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:57:15,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:57:15,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:57:15,638 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 [2019-11-19 19:57:15,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:57:15,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:57:15,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:57:15,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:57:15,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:57:15,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:57:15,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:57:15,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:57:15,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:57:15,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:57:15,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:57:15,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:57:15,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:57:15,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:57:15,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:57:15,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:57:15,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:57:15,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:57:15,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:57:15,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:57:15,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:57:15,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:57:15,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:57:15,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:57:15,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:57:15,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:57:15,703 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) [2019-11-19 19:57:15,729 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:57:15,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:57:15,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:57:15,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:57:15,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:57:15,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:57:15,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:57:15,740 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:57:15,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:57:15,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:57:15,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:57:15,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:57:15,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:57:15,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:57:15,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:57:15,782 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 19:57:15,818 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-19 19:57:15,819 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:57:15,829 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:57:15,836 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 19:57:15,836 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 19:57:15,837 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_1) = -2*ULTIMATE.start_main_~i~0 + 21*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_1 Supporting invariants [] [2019-11-19 19:57:15,849 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-19 19:57:15,859 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 19:57:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:15,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 19:57:15,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:57:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:15,917 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 19:57:15,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:57:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:15,972 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-19 19:57:15,974 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-11-19 19:57:16,044 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 25 states and 35 transitions. Complement of second has 8 states. [2019-11-19 19:57:16,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-19 19:57:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 19:57:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-11-19 19:57:16,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-19 19:57:16,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:57:16,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-19 19:57:16,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:57:16,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-19 19:57:16,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:57:16,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2019-11-19 19:57:16,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:16,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 7 states and 9 transitions. [2019-11-19 19:57:16,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-19 19:57:16,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-19 19:57:16,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2019-11-19 19:57:16,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:57:16,064 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-19 19:57:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2019-11-19 19:57:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-19 19:57:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 19:57:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-19 19:57:16,092 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-19 19:57:16,092 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-19 19:57:16,092 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 19:57:16,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-11-19 19:57:16,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:16,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:57:16,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:57:16,094 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-19 19:57:16,094 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 19:57:16,094 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 84#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, 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; 85#L19-3 assume !(main_~i~0 < 11); 82#L19-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~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 83#L26-2 [2019-11-19 19:57:16,094 INFO L796 eck$LassoCheckResult]: Loop: 83#L26-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~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 83#L26-2 [2019-11-19 19:57:16,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:16,095 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-19 19:57:16,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:16,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859694333] [2019-11-19 19:57:16,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:16,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859694333] [2019-11-19 19:57:16,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:57:16,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 19:57:16,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477740285] [2019-11-19 19:57:16,147 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:57:16,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:16,148 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2019-11-19 19:57:16,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:16,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152769117] [2019-11-19 19:57:16,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:16,197 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:16,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:57:16,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:57:16,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:57:16,269 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-19 19:57:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:57:16,295 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-11-19 19:57:16,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:57:16,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-19 19:57:16,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:16,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-11-19 19:57:16,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 19:57:16,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 19:57:16,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-11-19 19:57:16,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:57:16,302 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-19 19:57:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-11-19 19:57:16,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-11-19 19:57:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 19:57:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-11-19 19:57:16,304 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-19 19:57:16,304 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-19 19:57:16,304 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 19:57:16,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-11-19 19:57:16,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:16,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:57:16,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:57:16,307 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-19 19:57:16,308 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 19:57:16,308 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, 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; 105#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 108#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 109#L19-3 assume !(main_~i~0 < 11); 106#L19-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~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 107#L26-2 [2019-11-19 19:57:16,308 INFO L796 eck$LassoCheckResult]: Loop: 107#L26-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~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 107#L26-2 [2019-11-19 19:57:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:16,308 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-19 19:57:16,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:16,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937013390] [2019-11-19 19:57:16,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:16,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937013390] [2019-11-19 19:57:16,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628813937] [2019-11-19 19:57:16,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:57:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:16,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 19:57:16,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:57:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:16,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:57:16,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-19 19:57:16,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382878218] [2019-11-19 19:57:16,431 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:57:16,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:16,431 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2019-11-19 19:57:16,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:16,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466148313] [2019-11-19 19:57:16,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:16,455 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:16,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:57:16,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 19:57:16,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 19:57:16,526 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-11-19 19:57:16,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:57:16,554 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-11-19 19:57:16,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 19:57:16,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-11-19 19:57:16,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:16,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2019-11-19 19:57:16,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 19:57:16,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 19:57:16,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2019-11-19 19:57:16,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:57:16,558 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-19 19:57:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2019-11-19 19:57:16,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-11-19 19:57:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-19 19:57:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-19 19:57:16,560 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-19 19:57:16,560 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-19 19:57:16,561 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 19:57:16,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-19 19:57:16,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:16,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:57:16,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:57:16,563 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-19 19:57:16,563 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 19:57:16,563 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 145#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, 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; 146#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 150#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 151#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 152#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 153#L19-3 assume !(main_~i~0 < 11); 147#L19-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~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 148#L26-2 [2019-11-19 19:57:16,563 INFO L796 eck$LassoCheckResult]: Loop: 148#L26-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~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 148#L26-2 [2019-11-19 19:57:16,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:16,564 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-11-19 19:57:16,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:16,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112739990] [2019-11-19 19:57:16,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:16,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112739990] [2019-11-19 19:57:16,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386962198] [2019-11-19 19:57:16,626 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:57:16,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 19:57:16,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:57:16,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 19:57:16,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:57:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:16,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:57:16,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-19 19:57:16,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510751666] [2019-11-19 19:57:16,683 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:57:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:16,683 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2019-11-19 19:57:16,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:16,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181913920] [2019-11-19 19:57:16,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:16,702 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:28,780 WARN L191 SmtUtils]: Spent 12.08 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-19 19:57:40,845 WARN L191 SmtUtils]: Spent 12.06 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-19 19:57:40,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:57:40,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 19:57:40,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:57:40,847 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-11-19 19:57:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:57:40,893 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-11-19 19:57:40,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 19:57:40,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-11-19 19:57:40,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:40,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-11-19 19:57:40,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 19:57:40,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 19:57:40,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-11-19 19:57:40,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:57:40,896 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-19 19:57:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-11-19 19:57:40,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-11-19 19:57:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-19 19:57:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-11-19 19:57:40,898 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-19 19:57:40,898 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-19 19:57:40,898 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 19:57:40,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-11-19 19:57:40,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:40,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:57:40,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:57:40,900 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-19 19:57:40,900 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 19:57:40,900 INFO L794 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 199#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, 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; 200#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 201#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 207#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 205#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 202#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 203#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 206#L19-3 assume !(main_~i~0 < 11); 197#L19-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~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 198#L26-2 [2019-11-19 19:57:40,900 INFO L796 eck$LassoCheckResult]: Loop: 198#L26-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~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 198#L26-2 [2019-11-19 19:57:40,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:40,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-11-19 19:57:40,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:40,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727972138] [2019-11-19 19:57:40,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:40,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727972138] [2019-11-19 19:57:40,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516734025] [2019-11-19 19:57:40,969 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:57:41,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 19:57:41,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:57:41,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 19:57:41,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:57:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:41,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:57:41,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-19 19:57:41,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806987805] [2019-11-19 19:57:41,051 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:57:41,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:41,052 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2019-11-19 19:57:41,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:41,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805448824] [2019-11-19 19:57:41,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:41,070 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:41,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:57:41,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 19:57:41,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:57:41,144 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-19 19:57:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:57:41,181 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-11-19 19:57:41,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 19:57:41,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2019-11-19 19:57:41,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:41,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2019-11-19 19:57:41,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 19:57:41,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 19:57:41,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2019-11-19 19:57:41,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:57:41,184 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 19:57:41,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2019-11-19 19:57:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-11-19 19:57:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-19 19:57:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-19 19:57:41,186 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-19 19:57:41,187 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-19 19:57:41,187 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 19:57:41,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-11-19 19:57:41,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:41,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:57:41,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:57:41,188 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-19 19:57:41,188 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 19:57:41,189 INFO L794 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 262#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, 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; 263#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 265#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 266#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 267#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 268#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 272#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 271#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 270#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 269#L19-3 assume !(main_~i~0 < 11); 260#L19-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~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 261#L26-2 [2019-11-19 19:57:41,189 INFO L796 eck$LassoCheckResult]: Loop: 261#L26-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~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 261#L26-2 [2019-11-19 19:57:41,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:41,189 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-11-19 19:57:41,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:41,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743518082] [2019-11-19 19:57:41,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:41,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743518082] [2019-11-19 19:57:41,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170752502] [2019-11-19 19:57:41,276 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:57:41,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 19:57:41,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:57:41,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 19:57:41,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:57:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:41,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:57:41,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-19 19:57:41,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010790622] [2019-11-19 19:57:41,334 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:57:41,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:41,334 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 5 times [2019-11-19 19:57:41,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:41,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268569627] [2019-11-19 19:57:41,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:41,349 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:41,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:57:41,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 19:57:41,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:57:41,429 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 8 states. [2019-11-19 19:57:41,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:57:41,470 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-11-19 19:57:41,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 19:57:41,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2019-11-19 19:57:41,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:41,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2019-11-19 19:57:41,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 19:57:41,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 19:57:41,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2019-11-19 19:57:41,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:57:41,475 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-19 19:57:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2019-11-19 19:57:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-11-19 19:57:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 19:57:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-19 19:57:41,479 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 19:57:41,479 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 19:57:41,479 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 19:57:41,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-19 19:57:41,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:41,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:57:41,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:57:41,481 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-11-19 19:57:41,481 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 19:57:41,483 INFO L794 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 336#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, 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; 337#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 338#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 339#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 340#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 342#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 348#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 347#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 346#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 345#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 344#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 343#L19-3 assume !(main_~i~0 < 11); 334#L19-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~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 335#L26-2 [2019-11-19 19:57:41,483 INFO L796 eck$LassoCheckResult]: Loop: 335#L26-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~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 335#L26-2 [2019-11-19 19:57:41,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:41,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-11-19 19:57:41,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:41,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365084296] [2019-11-19 19:57:41,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:41,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365084296] [2019-11-19 19:57:41,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433686596] [2019-11-19 19:57:41,587 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:57:41,654 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-19 19:57:41,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:57:41,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 19:57:41,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:57:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:41,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:57:41,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-19 19:57:41,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477625840] [2019-11-19 19:57:41,687 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:57:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:41,688 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 6 times [2019-11-19 19:57:41,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:41,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557715421] [2019-11-19 19:57:41,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:41,716 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:41,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:57:41,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:57:41,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:57:41,794 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 9 states. [2019-11-19 19:57:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:57:41,842 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-11-19 19:57:41,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 19:57:41,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2019-11-19 19:57:41,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:41,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2019-11-19 19:57:41,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 19:57:41,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 19:57:41,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2019-11-19 19:57:41,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:57:41,845 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-19 19:57:41,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2019-11-19 19:57:41,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-19 19:57:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-19 19:57:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-19 19:57:41,848 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-19 19:57:41,848 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-19 19:57:41,848 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 19:57:41,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-11-19 19:57:41,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:41,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:57:41,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:57:41,850 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2019-11-19 19:57:41,850 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 19:57:41,850 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, 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; 420#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 424#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 425#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 426#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 435#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 434#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 433#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 432#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 431#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 430#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 429#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 428#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 427#L19-3 assume !(main_~i~0 < 11); 421#L19-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~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 422#L26-2 [2019-11-19 19:57:41,850 INFO L796 eck$LassoCheckResult]: Loop: 422#L26-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~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 422#L26-2 [2019-11-19 19:57:41,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:41,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2019-11-19 19:57:41,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:41,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344247715] [2019-11-19 19:57:41,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:41,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344247715] [2019-11-19 19:57:41,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716640094] [2019-11-19 19:57:41,977 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:57:42,042 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-19 19:57:42,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:57:42,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 19:57:42,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:57:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:42,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:57:42,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-19 19:57:42,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243218118] [2019-11-19 19:57:42,076 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:57:42,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:42,076 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 7 times [2019-11-19 19:57:42,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:42,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441717114] [2019-11-19 19:57:42,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:42,095 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:42,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:57:42,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 19:57:42,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-19 19:57:42,160 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 10 states. [2019-11-19 19:57:42,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:57:42,208 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-19 19:57:42,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 19:57:42,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-11-19 19:57:42,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:42,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2019-11-19 19:57:42,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 19:57:42,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 19:57:42,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2019-11-19 19:57:42,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:57:42,212 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-19 19:57:42,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2019-11-19 19:57:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-19 19:57:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-19 19:57:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-11-19 19:57:42,214 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-19 19:57:42,214 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-19 19:57:42,214 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-19 19:57:42,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2019-11-19 19:57:42,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:42,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:57:42,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:57:42,215 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2019-11-19 19:57:42,216 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 19:57:42,216 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 515#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, 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; 516#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 520#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 521#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 522#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 533#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 532#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 531#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 530#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 529#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 528#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 527#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 526#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 525#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 524#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 523#L19-3 assume !(main_~i~0 < 11); 517#L19-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~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 518#L26-2 [2019-11-19 19:57:42,216 INFO L796 eck$LassoCheckResult]: Loop: 518#L26-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~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 518#L26-2 [2019-11-19 19:57:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:42,216 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2019-11-19 19:57:42,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:42,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597792102] [2019-11-19 19:57:42,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:42,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597792102] [2019-11-19 19:57:42,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097645445] [2019-11-19 19:57:42,303 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:57:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:42,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 19:57:42,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:57:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:42,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:57:42,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-19 19:57:42,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827177169] [2019-11-19 19:57:42,373 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:57:42,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:42,373 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 8 times [2019-11-19 19:57:42,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:42,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105259428] [2019-11-19 19:57:42,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:42,386 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:42,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:57:42,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 19:57:42,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-19 19:57:42,438 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 11 states. [2019-11-19 19:57:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:57:42,481 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-11-19 19:57:42,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 19:57:42,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2019-11-19 19:57:42,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:42,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2019-11-19 19:57:42,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 19:57:42,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 19:57:42,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2019-11-19 19:57:42,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:57:42,487 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-19 19:57:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2019-11-19 19:57:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-11-19 19:57:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-19 19:57:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-11-19 19:57:42,489 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-19 19:57:42,489 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-19 19:57:42,489 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-19 19:57:42,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-11-19 19:57:42,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:42,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:57:42,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:57:42,491 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2019-11-19 19:57:42,491 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 19:57:42,491 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 624#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, 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; 625#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 626#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 627#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 628#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 630#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 642#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 641#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 640#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 639#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 638#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 637#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 636#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 635#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 634#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 633#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 632#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 631#L19-3 assume !(main_~i~0 < 11); 622#L19-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~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 623#L26-2 [2019-11-19 19:57:42,491 INFO L796 eck$LassoCheckResult]: Loop: 623#L26-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~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 623#L26-2 [2019-11-19 19:57:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:42,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2019-11-19 19:57:42,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:42,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041371623] [2019-11-19 19:57:42,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:42,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041371623] [2019-11-19 19:57:42,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414420368] [2019-11-19 19:57:42,618 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:57:42,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 19:57:42,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:57:42,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 19:57:42,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:57:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:42,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:57:42,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-19 19:57:42,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825620369] [2019-11-19 19:57:42,699 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:57:42,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:42,701 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 9 times [2019-11-19 19:57:42,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:42,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805064012] [2019-11-19 19:57:42,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:42,723 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:42,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:57:42,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 19:57:42,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-19 19:57:42,805 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 12 states. [2019-11-19 19:57:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:57:42,877 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-11-19 19:57:42,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 19:57:42,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2019-11-19 19:57:42,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:42,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2019-11-19 19:57:42,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 19:57:42,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 19:57:42,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2019-11-19 19:57:42,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:57:42,880 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-19 19:57:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2019-11-19 19:57:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-11-19 19:57:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-19 19:57:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-19 19:57:42,884 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-19 19:57:42,885 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-19 19:57:42,885 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-19 19:57:42,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2019-11-19 19:57:42,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:42,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:57:42,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:57:42,888 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2019-11-19 19:57:42,888 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 19:57:42,889 INFO L794 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 740#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, 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; 741#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 745#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 746#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 747#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 762#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 761#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 760#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 759#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 758#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 757#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 756#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 755#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 754#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 753#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 752#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 751#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 750#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 749#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 748#L19-3 assume !(main_~i~0 < 11); 742#L19-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~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 743#L26-2 [2019-11-19 19:57:42,889 INFO L796 eck$LassoCheckResult]: Loop: 743#L26-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~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 743#L26-2 [2019-11-19 19:57:42,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:42,889 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2019-11-19 19:57:42,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:42,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438113625] [2019-11-19 19:57:42,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:43,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438113625] [2019-11-19 19:57:43,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655044808] [2019-11-19 19:57:43,022 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:57:43,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-19 19:57:43,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:57:43,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 19:57:43,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:57:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:43,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:57:43,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-19 19:57:43,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370653829] [2019-11-19 19:57:43,155 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:57:43,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:43,156 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 10 times [2019-11-19 19:57:43,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:43,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798383193] [2019-11-19 19:57:43,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:43,166 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:43,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:57:43,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 19:57:43,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-19 19:57:43,224 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 13 states. [2019-11-19 19:57:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:57:43,278 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-19 19:57:43,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 19:57:43,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-11-19 19:57:43,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:43,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2019-11-19 19:57:43,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-19 19:57:43,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-19 19:57:43,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2019-11-19 19:57:43,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:57:43,281 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-11-19 19:57:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2019-11-19 19:57:43,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-11-19 19:57:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 19:57:43,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-19 19:57:43,284 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-19 19:57:43,284 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-19 19:57:43,284 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-19 19:57:43,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2019-11-19 19:57:43,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:43,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:57:43,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:57:43,286 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2019-11-19 19:57:43,286 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 19:57:43,286 INFO L794 eck$LassoCheckResult]: Stem: 874#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 870#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, 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; 871#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 875#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 876#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 877#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 894#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 893#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 892#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 891#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 890#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 889#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 888#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 887#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 886#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 885#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 884#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 883#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 882#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 881#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 880#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 879#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 878#L19-3 assume !(main_~i~0 < 11); 872#L19-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~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 873#L26-2 [2019-11-19 19:57:43,286 INFO L796 eck$LassoCheckResult]: Loop: 873#L26-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~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 873#L26-2 [2019-11-19 19:57:43,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:43,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2019-11-19 19:57:43,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:43,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898214622] [2019-11-19 19:57:43,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:57:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:43,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898214622] [2019-11-19 19:57:43,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970735472] [2019-11-19 19:57:43,428 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:57:43,481 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 19:57:43,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:57:43,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 19:57:43,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:57:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:57:43,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:57:43,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-11-19 19:57:43,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806299024] [2019-11-19 19:57:43,510 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:57:43,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:43,510 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 11 times [2019-11-19 19:57:43,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:43,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379777806] [2019-11-19 19:57:43,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:43,519 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:43,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:57:43,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 19:57:43,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-11-19 19:57:43,580 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 14 states. [2019-11-19 19:57:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:57:43,653 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-11-19 19:57:43,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 19:57:43,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2019-11-19 19:57:43,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:43,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2019-11-19 19:57:43,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-19 19:57:43,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-19 19:57:43,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2019-11-19 19:57:43,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:57:43,656 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-19 19:57:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2019-11-19 19:57:43,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-11-19 19:57:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-19 19:57:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-19 19:57:43,659 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-19 19:57:43,659 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-19 19:57:43,659 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-19 19:57:43,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2019-11-19 19:57:43,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 19:57:43,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:57:43,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:57:43,662 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1] [2019-11-19 19:57:43,662 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 19:57:43,663 INFO L794 eck$LassoCheckResult]: Stem: 1014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1010#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, 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; 1011#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1015#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1016#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1017#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1036#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1035#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1034#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1033#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1032#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1031#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1030#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1029#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1028#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1027#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1026#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1025#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1024#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1023#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1022#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1021#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1020#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1019#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1018#L19-3 assume !(main_~i~0 < 11); 1012#L19-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~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1013#L26-2 [2019-11-19 19:57:43,663 INFO L796 eck$LassoCheckResult]: Loop: 1013#L26-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~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1013#L26-2 [2019-11-19 19:57:43,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:43,663 INFO L82 PathProgramCache]: Analyzing trace with hash -95647583, now seen corresponding path program 11 times [2019-11-19 19:57:43,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:43,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239041766] [2019-11-19 19:57:43,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:43,737 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:43,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:43,737 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 12 times [2019-11-19 19:57:43,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:43,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863306359] [2019-11-19 19:57:43,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:43,759 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:43,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:57:43,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1329892248, now seen corresponding path program 1 times [2019-11-19 19:57:43,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:57:43,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78740446] [2019-11-19 19:57:43,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:57:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:57:43,839 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:57:55,905 WARN L191 SmtUtils]: Spent 12.06 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-19 19:58:07,977 WARN L191 SmtUtils]: Spent 12.07 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-19 19:58:17,026 WARN L191 SmtUtils]: Spent 9.04 s on a formula simplification. DAG size of input: 216 DAG size of output: 164 [2019-11-19 19:58:17,303 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-19 19:58:17,309 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 19:58:17,309 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 19:58:17,309 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 19:58:17,309 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 19:58:17,309 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 19:58:17,309 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:58:17,310 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 19:58:17,310 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 19:58:17,310 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration13_Lasso [2019-11-19 19:58:17,310 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 19:58:17,310 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 19:58:17,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:58:17,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:58:17,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:58:17,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:58:17,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:58:17,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:58:17,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:58:17,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:58:17,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:58:17,641 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-19 19:58:17,933 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-11-19 19:58:17,951 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 19:58:17,951 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:58:17,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:58:17,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:58:17,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:58:17,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:58:17,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:58:17,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:58:17,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:58:17,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:58:17,963 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 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 [2019-11-19 19:58:17,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:58:17,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:58:17,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:58:17,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:58:17,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:58:17,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:58:17,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:58:17,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:58:17,975 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:58:17,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:58:17,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:58:17,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:58:17,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:58:17,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:58:17,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:58:17,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:58:17,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:58:18,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:58:18,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:58:18,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:58:18,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:58:18,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:58:18,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:58:18,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:58:18,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:58:18,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:58:18,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:58:18,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:58:18,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:58:18,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:58:18,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:58:18,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:58:18,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:58:18,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:58:18,032 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:58:18,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:58:18,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:58:18,043 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-19 19:58:18,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:58:18,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:58:18,046 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-19 19:58:18,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:58:18,054 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:58:18,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:58:18,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:58:18,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:58:18,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:58:18,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:58:18,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:58:18,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:58:18,072 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:58:18,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:58:18,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:58:18,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:58:18,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:58:18,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:58:18,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:58:18,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:58:18,121 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 19:58:18,139 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-19 19:58:18,140 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:58:18,148 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 19:58:18,150 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 19:58:18,150 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 19:58:18,150 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 [] [2019-11-19 19:58:18,154 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-19 19:58:18,156 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 19:58:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:58:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:58:18,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 19:58:18,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:58:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:58:18,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 19:58:18,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:58:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:58:18,208 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 [2019-11-19 19:58:18,208 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 2 states. [2019-11-19 19:58:18,214 INFO L76 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. [2019-11-19 19:58:18,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-19 19:58:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-19 19:58:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2019-11-19 19:58:18,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 1 letters. [2019-11-19 19:58:18,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:58:18,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 27 letters. Loop has 1 letters. [2019-11-19 19:58:18,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:58:18,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2019-11-19 19:58:18,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:58:18,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-11-19 19:58:18,218 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 19:58:18,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2019-11-19 19:58:18,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-19 19:58:18,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-19 19:58:18,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-19 19:58:18,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:58:18,218 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 19:58:18,218 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 19:58:18,219 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 19:58:18,219 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-19 19:58:18,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-19 19:58:18,219 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 19:58:18,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-19 19:58:18,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 07:58:18 BoogieIcfgContainer [2019-11-19 19:58:18,225 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 19:58:18,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 19:58:18,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 19:58:18,226 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 19:58:18,226 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:57:14" (3/4) ... [2019-11-19 19:58:18,229 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 19:58:18,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 19:58:18,231 INFO L168 Benchmark]: Toolchain (without parser) took 64180.79 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 253.2 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. [2019-11-19 19:58:18,231 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:58:18,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.27 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 19:58:18,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-19 19:58:18,233 INFO L168 Benchmark]: Boogie Preprocessor took 23.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-19 19:58:18,233 INFO L168 Benchmark]: RCFGBuilder took 299.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-11-19 19:58:18,234 INFO L168 Benchmark]: BuchiAutomizer took 63504.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.0 MB). Peak memory consumption was 80.1 MB. Max. memory is 11.5 GB. [2019-11-19 19:58:18,234 INFO L168 Benchmark]: Witness Printer took 4.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:58:18,237 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.27 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 299.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 63504.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.0 MB). Peak memory consumption was 80.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 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 -2 * i + 21 * unknown-#length-unknown[in] 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 63.4s and 14 iterations. TraceHistogramMax:11. Analysis of lassos took 62.4s. 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, 57 SDs, 0 SdLazy, 299 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital153 mio100 ax100 hnf100 lsp95 ukn55 mio100 lsp57 div155 bol100 ite103 ukn100 eq156 hnf73 smp97 dnf130 smp98 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 3 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...