./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 906a4fb5 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 58eecb02814a6b78cadd872f0ade36a8b32c0833 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 18:53:05,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:53:05,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:53:05,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:53:05,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:53:05,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:53:05,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:53:05,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:53:05,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:53:05,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:53:05,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:53:05,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:53:05,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:53:05,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:53:05,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:53:05,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:53:05,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:53:05,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:53:05,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:53:05,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:53:05,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:53:05,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:53:05,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:53:05,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:53:05,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:53:05,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:53:05,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:53:05,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:53:05,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:53:05,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:53:05,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:53:05,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:53:05,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:53:05,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:53:05,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:53:05,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:53:05,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:53:05,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:53:05,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:53:05,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:53:05,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:53:05,881 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 18:53:05,906 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:53:05,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:53:05,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:53:05,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:53:05,909 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:53:05,909 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:53:05,909 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:53:05,909 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:53:05,910 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:53:05,910 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:53:05,910 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:53:05,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:53:05,911 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 18:53:05,911 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:53:05,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:53:05,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 18:53:05,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:53:05,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:53:05,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:53:05,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:53:05,913 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 18:53:05,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:53:05,913 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:53:05,914 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:53:05,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:53:05,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:53:05,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:53:05,915 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:53:05,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:53:05,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:53:05,916 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:53:05,916 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:53:05,917 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:53:05,917 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 58eecb02814a6b78cadd872f0ade36a8b32c0833 [2020-10-19 18:53:06,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:53:06,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:53:06,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:53:06,244 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:53:06,245 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:53:06,246 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2020-10-19 18:53:06,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3656bfd6/ae3d9fd119b549779329e4c19115618a/FLAG6dee20e10 [2020-10-19 18:53:06,770 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:53:06,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2020-10-19 18:53:06,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3656bfd6/ae3d9fd119b549779329e4c19115618a/FLAG6dee20e10 [2020-10-19 18:53:07,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3656bfd6/ae3d9fd119b549779329e4c19115618a [2020-10-19 18:53:07,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:53:07,166 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:53:07,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:53:07,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:53:07,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:53:07,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:53:07" (1/1) ... [2020-10-19 18:53:07,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cbc65c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:53:07, skipping insertion in model container [2020-10-19 18:53:07,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:53:07" (1/1) ... [2020-10-19 18:53:07,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:53:07,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:53:07,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:53:07,389 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:53:07,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:53:07,428 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:53:07,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:53:07 WrapperNode [2020-10-19 18:53:07,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:53:07,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:53:07,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:53:07,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:53:07,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:53:07" (1/1) ... [2020-10-19 18:53:07,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:53:07" (1/1) ... [2020-10-19 18:53:07,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:53:07,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:53:07,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:53:07,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:53:07,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:53:07" (1/1) ... [2020-10-19 18:53:07,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:53:07" (1/1) ... [2020-10-19 18:53:07,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:53:07" (1/1) ... [2020-10-19 18:53:07,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:53:07" (1/1) ... [2020-10-19 18:53:07,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:53:07" (1/1) ... [2020-10-19 18:53:07,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:53:07" (1/1) ... [2020-10-19 18:53:07,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:53:07" (1/1) ... [2020-10-19 18:53:07,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:53:07,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:53:07,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:53:07,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:53:07,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:53:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:07,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 18:53:07,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 18:53:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 18:53:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:53:07,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:53:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 18:53:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 18:53:07,867 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:53:07,868 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-19 18:53:07,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:53:07 BoogieIcfgContainer [2020-10-19 18:53:07,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:53:07,871 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:53:07,871 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:53:07,875 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:53:07,876 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:53:07,876 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:53:07" (1/3) ... [2020-10-19 18:53:07,878 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53e911a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:53:07, skipping insertion in model container [2020-10-19 18:53:07,878 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:53:07,878 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:53:07" (2/3) ... [2020-10-19 18:53:07,879 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53e911a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:53:07, skipping insertion in model container [2020-10-19 18:53:07,879 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:53:07,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:53:07" (3/3) ... [2020-10-19 18:53:07,881 INFO L373 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2020-10-19 18:53:07,959 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:53:07,959 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:53:07,959 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:53:07,960 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:53:07,960 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:53:07,960 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:53:07,960 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:53:07,961 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:53:07,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-10-19 18:53:08,025 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-10-19 18:53:08,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:53:08,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:53:08,032 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:53:08,032 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:53:08,032 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:53:08,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-10-19 18:53:08,034 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-10-19 18:53:08,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:53:08,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:53:08,035 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:53:08,035 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:53:08,041 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 11#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 7#L21-3true [2020-10-19 18:53:08,041 INFO L796 eck$LassoCheckResult]: Loop: 7#L21-3true assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 9#L21-2true main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 7#L21-3true [2020-10-19 18:53:08,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:08,047 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 18:53:08,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:08,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350600729] [2020-10-19 18:53:08,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:08,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:08,191 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:08,216 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:08,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:08,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-19 18:53:08,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:08,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854098728] [2020-10-19 18:53:08,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:08,234 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:08,240 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:08,243 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:08,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:08,245 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-19 18:53:08,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:08,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286984973] [2020-10-19 18:53:08,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:08,271 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:08,300 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:08,311 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:08,717 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2020-10-19 18:53:08,846 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-19 18:53:08,859 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:53:08,861 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:53:08,861 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:53:08,861 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:53:08,861 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:53:08,862 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:08,862 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:53:08,862 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:53:08,863 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration1_Lasso [2020-10-19 18:53:08,863 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:53:08,863 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:53:08,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:08,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:08,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:08,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:08,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:08,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:08,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:08,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:08,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:08,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:08,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:08,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:09,143 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2020-10-19 18:53:09,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:09,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:09,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:09,524 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:53:09,530 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:53:09,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:09,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:09,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:53:09,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:09,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:09,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:09,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:53:09,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:09,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:53:09,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:09,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:09,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:09,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:09,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:09,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:09,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:09,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:53:09,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:09,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:09,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:53:09,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:09,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:09,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:09,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:53:09,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:09,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:53:09,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:09,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:09,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:53:09,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:09,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:09,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:09,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:53:09,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:09,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:53:09,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:09,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:09,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:53:09,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:09,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:09,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:09,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:53:09,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:09,784 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 [2020-10-19 18:53:09,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:09,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:09,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:53:09,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:09,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:09,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:09,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:53:09,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:53:09,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:09,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:09,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:09,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:09,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:09,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:09,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:09,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:53:09,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:09,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:09,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:09,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:53:09,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:09,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:09,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:09,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:53:09,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:53:09,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:09,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:09,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:09,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:53:09,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:09,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:09,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:09,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:53:09,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:53:09,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:53:09,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:09,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:09,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:53:09,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:09,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:09,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:09,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:53:09,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:53:09,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:10,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:10,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:10,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:53:10,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:10,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:10,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:10,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:53:10,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:53:10,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:53:10,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:10,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:10,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:10,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:10,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:10,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:10,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:10,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:10,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:10,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:10,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:53:10,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:10,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:10,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:10,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:53:10,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:53:10,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:10,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:10,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:10,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:10,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:10,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:10,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:10,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:53:10,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:10,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:10,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:10,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:10,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:10,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:10,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:10,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:53:10,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:10,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:10,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:10,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:10,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:10,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:10,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:10,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:53:10,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:10,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:10,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:10,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:10,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:10,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:10,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:10,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:53:10,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:53:10,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:10,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:10,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:10,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:10,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:10,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:10,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:10,370 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:53:10,582 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-19 18:53:10,582 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:53:10,599 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:10,603 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:53:10,604 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:53:10,605 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 [] [2020-10-19 18:53:10,683 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-19 18:53:10,694 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:53:10,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:10,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:53:10,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:53:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:10,773 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:53:10,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:53:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:10,843 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 18:53:10,845 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2020-10-19 18:53:10,973 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 27 states and 37 transitions. Complement of second has 8 states. [2020-10-19 18:53:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:53:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:53:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-10-19 18:53:10,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-19 18:53:10,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:53:10,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-19 18:53:10,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:53:10,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-19 18:53:10,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:53:10,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. [2020-10-19 18:53:10,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:11,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 7 states and 9 transitions. [2020-10-19 18:53:11,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-10-19 18:53:11,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-10-19 18:53:11,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2020-10-19 18:53:11,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:53:11,013 INFO L691 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-10-19 18:53:11,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2020-10-19 18:53:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-10-19 18:53:11,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-19 18:53:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-10-19 18:53:11,048 INFO L714 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-10-19 18:53:11,049 INFO L594 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-10-19 18:53:11,049 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:53:11,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-10-19 18:53:11,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:11,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:53:11,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:53:11,052 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:53:11,052 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 18:53:11,053 INFO L794 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 125#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 126#L21-3 assume !(main_~i~0 < 11); 129#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 127#L28-2 [2020-10-19 18:53:11,053 INFO L796 eck$LassoCheckResult]: Loop: 127#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 127#L28-2 [2020-10-19 18:53:11,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:11,054 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-10-19 18:53:11,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:11,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939431310] [2020-10-19 18:53:11,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:11,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939431310] [2020-10-19 18:53:11,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:53:11,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:53:11,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050283581] [2020-10-19 18:53:11,205 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:53:11,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:11,206 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2020-10-19 18:53:11,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:11,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865047223] [2020-10-19 18:53:11,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:11,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:11,235 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:11,238 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:11,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:53:11,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:53:11,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:53:11,378 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-19 18:53:11,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:53:11,402 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-10-19 18:53:11,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:53:11,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2020-10-19 18:53:11,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:11,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2020-10-19 18:53:11,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-19 18:53:11,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-19 18:53:11,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2020-10-19 18:53:11,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:53:11,406 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-19 18:53:11,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2020-10-19 18:53:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2020-10-19 18:53:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-19 18:53:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2020-10-19 18:53:11,408 INFO L714 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-10-19 18:53:11,408 INFO L594 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-10-19 18:53:11,408 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:53:11,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-10-19 18:53:11,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:11,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:53:11,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:53:11,410 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-19 18:53:11,410 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 18:53:11,410 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 147#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 148#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 152#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 153#L21-3 assume !(main_~i~0 < 11); 151#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 149#L28-2 [2020-10-19 18:53:11,411 INFO L796 eck$LassoCheckResult]: Loop: 149#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 149#L28-2 [2020-10-19 18:53:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:11,411 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-10-19 18:53:11,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:11,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843862225] [2020-10-19 18:53:11,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:11,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843862225] [2020-10-19 18:53:11,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328588702] [2020-10-19 18:53:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:53:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:11,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-19 18:53:11,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:53:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:11,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:53:11,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-19 18:53:11,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922380625] [2020-10-19 18:53:11,512 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:53:11,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:11,513 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2020-10-19 18:53:11,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:11,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524917196] [2020-10-19 18:53:11,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:11,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:11,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:11,532 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:11,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:53:11,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 18:53:11,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 18:53:11,623 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 5 states. [2020-10-19 18:53:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:53:11,648 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-10-19 18:53:11,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 18:53:11,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-10-19 18:53:11,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:11,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2020-10-19 18:53:11,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-19 18:53:11,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-19 18:53:11,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-10-19 18:53:11,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:53:11,651 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-19 18:53:11,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-10-19 18:53:11,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2020-10-19 18:53:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-19 18:53:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-10-19 18:53:11,653 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-19 18:53:11,653 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-19 18:53:11,653 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:53:11,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-10-19 18:53:11,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:11,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:53:11,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:53:11,655 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-19 18:53:11,655 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 18:53:11,655 INFO L794 eck$LassoCheckResult]: Stem: 191#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 188#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 189#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 193#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 194#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 195#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 196#L21-3 assume !(main_~i~0 < 11); 192#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 190#L28-2 [2020-10-19 18:53:11,656 INFO L796 eck$LassoCheckResult]: Loop: 190#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 190#L28-2 [2020-10-19 18:53:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-10-19 18:53:11,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:11,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937945544] [2020-10-19 18:53:11,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:11,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937945544] [2020-10-19 18:53:11,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112939000] [2020-10-19 18:53:11,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:53:11,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 18:53:11,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:53:11,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:53:11,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:53:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:11,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:53:11,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-19 18:53:11,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241647629] [2020-10-19 18:53:11,757 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:53:11,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:11,757 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2020-10-19 18:53:11,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:11,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308691041] [2020-10-19 18:53:11,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:11,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:11,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:11,775 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:11,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:53:11,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 18:53:11,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-19 18:53:11,852 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 6 states. [2020-10-19 18:53:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:53:11,884 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-10-19 18:53:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 18:53:11,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2020-10-19 18:53:11,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:11,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2020-10-19 18:53:11,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-19 18:53:11,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-19 18:53:11,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2020-10-19 18:53:11,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:53:11,888 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-19 18:53:11,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2020-10-19 18:53:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2020-10-19 18:53:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-19 18:53:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-10-19 18:53:11,890 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-19 18:53:11,890 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-19 18:53:11,890 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:53:11,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-10-19 18:53:11,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:11,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:53:11,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:53:11,892 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-10-19 18:53:11,893 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 18:53:11,893 INFO L794 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 240#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 241#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 245#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 246#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 247#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 248#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 250#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 249#L21-3 assume !(main_~i~0 < 11); 244#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 242#L28-2 [2020-10-19 18:53:11,893 INFO L796 eck$LassoCheckResult]: Loop: 242#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 242#L28-2 [2020-10-19 18:53:11,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:11,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-10-19 18:53:11,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:11,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499627863] [2020-10-19 18:53:11,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:11,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499627863] [2020-10-19 18:53:11,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093269032] [2020-10-19 18:53:11,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:53:12,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-19 18:53:12,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:53:12,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:53:12,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:53:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:12,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:53:12,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-19 18:53:12,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885233858] [2020-10-19 18:53:12,072 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:53:12,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:12,073 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2020-10-19 18:53:12,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:12,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495194729] [2020-10-19 18:53:12,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:12,083 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:12,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:12,101 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:12,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:53:12,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 18:53:12,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-19 18:53:12,176 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 7 states. [2020-10-19 18:53:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:53:12,213 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-10-19 18:53:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 18:53:12,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2020-10-19 18:53:12,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:12,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2020-10-19 18:53:12,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-19 18:53:12,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-19 18:53:12,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2020-10-19 18:53:12,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:53:12,216 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-19 18:53:12,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2020-10-19 18:53:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-10-19 18:53:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-19 18:53:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-10-19 18:53:12,219 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-19 18:53:12,219 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-19 18:53:12,219 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:53:12,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2020-10-19 18:53:12,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:12,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:53:12,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:53:12,221 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-10-19 18:53:12,221 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 18:53:12,222 INFO L794 eck$LassoCheckResult]: Stem: 306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 303#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 304#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 308#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 309#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 310#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 315#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 314#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 313#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 312#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 311#L21-3 assume !(main_~i~0 < 11); 307#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 305#L28-2 [2020-10-19 18:53:12,222 INFO L796 eck$LassoCheckResult]: Loop: 305#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 305#L28-2 [2020-10-19 18:53:12,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:12,222 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-10-19 18:53:12,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:12,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757114006] [2020-10-19 18:53:12,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:12,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757114006] [2020-10-19 18:53:12,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664147981] [2020-10-19 18:53:12,300 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:53:12,355 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-19 18:53:12,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:53:12,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:53:12,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:53:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:12,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:53:12,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-19 18:53:12,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30046067] [2020-10-19 18:53:12,421 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:53:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:12,423 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 5 times [2020-10-19 18:53:12,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:12,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015955974] [2020-10-19 18:53:12,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:12,439 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:12,456 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:12,458 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:12,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:53:12,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 18:53:12,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-19 18:53:12,553 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 8 states. [2020-10-19 18:53:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:53:12,598 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-10-19 18:53:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 18:53:12,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2020-10-19 18:53:12,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:12,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2020-10-19 18:53:12,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-19 18:53:12,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-19 18:53:12,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2020-10-19 18:53:12,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:53:12,603 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-10-19 18:53:12,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2020-10-19 18:53:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2020-10-19 18:53:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 18:53:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-10-19 18:53:12,606 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-19 18:53:12,606 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-19 18:53:12,606 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 18:53:12,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-10-19 18:53:12,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:12,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:53:12,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:53:12,609 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-10-19 18:53:12,609 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 18:53:12,609 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 377#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 378#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 382#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 383#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 384#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 391#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 390#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 389#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 388#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 387#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 386#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 385#L21-3 assume !(main_~i~0 < 11); 381#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 379#L28-2 [2020-10-19 18:53:12,609 INFO L796 eck$LassoCheckResult]: Loop: 379#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 379#L28-2 [2020-10-19 18:53:12,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:12,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-10-19 18:53:12,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:12,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648024332] [2020-10-19 18:53:12,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:12,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648024332] [2020-10-19 18:53:12,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205514991] [2020-10-19 18:53:12,714 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:53:12,768 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-19 18:53:12,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:53:12,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 18:53:12,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:53:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:12,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:53:12,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-19 18:53:12,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244920507] [2020-10-19 18:53:12,830 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:53:12,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:12,832 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 6 times [2020-10-19 18:53:12,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:12,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678320430] [2020-10-19 18:53:12,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:12,846 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:12,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:12,864 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:12,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:53:12,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-19 18:53:12,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-19 18:53:12,950 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 9 states. [2020-10-19 18:53:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:53:12,990 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-10-19 18:53:12,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 18:53:12,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2020-10-19 18:53:12,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:12,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2020-10-19 18:53:12,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-19 18:53:12,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-19 18:53:12,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2020-10-19 18:53:12,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:53:12,993 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-10-19 18:53:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2020-10-19 18:53:12,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-10-19 18:53:12,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-19 18:53:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-10-19 18:53:12,996 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-10-19 18:53:12,996 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-10-19 18:53:12,996 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 18:53:12,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2020-10-19 18:53:12,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:12,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:53:12,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:53:12,997 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2020-10-19 18:53:12,998 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 18:53:12,998 INFO L794 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 462#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 463#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 467#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 468#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 469#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 478#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 477#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 476#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 475#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 474#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 473#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 472#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 471#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 470#L21-3 assume !(main_~i~0 < 11); 466#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 464#L28-2 [2020-10-19 18:53:12,998 INFO L796 eck$LassoCheckResult]: Loop: 464#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 464#L28-2 [2020-10-19 18:53:12,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:12,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2020-10-19 18:53:12,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:12,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687903679] [2020-10-19 18:53:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:13,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687903679] [2020-10-19 18:53:13,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92174055] [2020-10-19 18:53:13,066 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:53:13,131 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-19 18:53:13,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:53:13,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:53:13,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:53:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:13,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:53:13,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-19 18:53:13,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409105055] [2020-10-19 18:53:13,162 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:53:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:13,162 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 7 times [2020-10-19 18:53:13,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:13,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743787755] [2020-10-19 18:53:13,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:13,169 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:13,174 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:13,176 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:13,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:53:13,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 18:53:13,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-19 18:53:13,254 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 10 states. [2020-10-19 18:53:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:53:13,296 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-10-19 18:53:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 18:53:13,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2020-10-19 18:53:13,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:13,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2020-10-19 18:53:13,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-19 18:53:13,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-19 18:53:13,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2020-10-19 18:53:13,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:53:13,300 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-10-19 18:53:13,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2020-10-19 18:53:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-10-19 18:53:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-19 18:53:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-10-19 18:53:13,302 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-10-19 18:53:13,303 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-10-19 18:53:13,303 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 18:53:13,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2020-10-19 18:53:13,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:13,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:53:13,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:53:13,305 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2020-10-19 18:53:13,305 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 18:53:13,305 INFO L794 eck$LassoCheckResult]: Stem: 561#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 558#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 559#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 563#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 564#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 565#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 576#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 575#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 574#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 573#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 572#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 571#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 570#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 569#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 568#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 567#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 566#L21-3 assume !(main_~i~0 < 11); 562#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 560#L28-2 [2020-10-19 18:53:13,305 INFO L796 eck$LassoCheckResult]: Loop: 560#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 560#L28-2 [2020-10-19 18:53:13,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:13,306 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2020-10-19 18:53:13,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:13,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823778656] [2020-10-19 18:53:13,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:13,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823778656] [2020-10-19 18:53:13,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049582585] [2020-10-19 18:53:13,388 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:53:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:13,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-19 18:53:13,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:53:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:13,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:53:13,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-19 18:53:13,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068417678] [2020-10-19 18:53:13,460 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:53:13,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:13,460 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 8 times [2020-10-19 18:53:13,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:13,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439026162] [2020-10-19 18:53:13,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:13,467 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:13,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:13,472 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:13,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:53:13,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-19 18:53:13,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-19 18:53:13,550 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 11 states. [2020-10-19 18:53:13,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:53:13,595 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-10-19 18:53:13,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 18:53:13,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2020-10-19 18:53:13,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:13,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2020-10-19 18:53:13,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-19 18:53:13,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-19 18:53:13,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2020-10-19 18:53:13,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:53:13,599 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-10-19 18:53:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2020-10-19 18:53:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-10-19 18:53:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-19 18:53:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-10-19 18:53:13,601 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-10-19 18:53:13,602 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-10-19 18:53:13,602 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 18:53:13,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2020-10-19 18:53:13,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:13,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:53:13,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:53:13,603 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2020-10-19 18:53:13,603 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 18:53:13,603 INFO L794 eck$LassoCheckResult]: Stem: 668#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 665#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 666#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 670#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 671#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 672#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 685#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 684#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 683#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 682#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 681#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 680#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 679#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 678#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 677#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 676#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 675#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 674#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 673#L21-3 assume !(main_~i~0 < 11); 669#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 667#L28-2 [2020-10-19 18:53:13,604 INFO L796 eck$LassoCheckResult]: Loop: 667#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 667#L28-2 [2020-10-19 18:53:13,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:13,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2020-10-19 18:53:13,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:13,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726278665] [2020-10-19 18:53:13,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:13,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726278665] [2020-10-19 18:53:13,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567296108] [2020-10-19 18:53:13,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:53:13,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 18:53:13,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:53:13,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:53:13,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:53:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:13,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:53:13,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-19 18:53:13,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653235520] [2020-10-19 18:53:13,803 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:53:13,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:13,803 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 9 times [2020-10-19 18:53:13,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:13,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068467066] [2020-10-19 18:53:13,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:13,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:13,815 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:13,816 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:13,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:53:13,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-19 18:53:13,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-19 18:53:13,893 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 12 states. [2020-10-19 18:53:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:53:13,962 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-10-19 18:53:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-19 18:53:13,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2020-10-19 18:53:13,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:13,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2020-10-19 18:53:13,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-19 18:53:13,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-19 18:53:13,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2020-10-19 18:53:13,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:53:13,964 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-10-19 18:53:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2020-10-19 18:53:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-10-19 18:53:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-19 18:53:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-10-19 18:53:13,967 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-10-19 18:53:13,967 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-10-19 18:53:13,967 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 18:53:13,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2020-10-19 18:53:13,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:13,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:53:13,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:53:13,969 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2020-10-19 18:53:13,969 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 18:53:13,969 INFO L794 eck$LassoCheckResult]: Stem: 786#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 783#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 784#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 788#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 789#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 790#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 805#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 804#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 803#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 802#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 801#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 800#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 799#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 798#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 797#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 796#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 795#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 794#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 793#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 792#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 791#L21-3 assume !(main_~i~0 < 11); 787#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 785#L28-2 [2020-10-19 18:53:13,969 INFO L796 eck$LassoCheckResult]: Loop: 785#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 785#L28-2 [2020-10-19 18:53:13,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:13,970 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2020-10-19 18:53:13,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:13,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280188455] [2020-10-19 18:53:13,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:14,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280188455] [2020-10-19 18:53:14,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848402515] [2020-10-19 18:53:14,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:53:14,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-10-19 18:53:14,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:53:14,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-19 18:53:14,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:53:14,224 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:14,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:53:14,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-10-19 18:53:14,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046199707] [2020-10-19 18:53:14,225 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:53:14,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:14,226 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 10 times [2020-10-19 18:53:14,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:14,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182701578] [2020-10-19 18:53:14,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:14,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:14,235 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:14,237 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:14,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:53:14,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-19 18:53:14,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-19 18:53:14,316 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 13 states. [2020-10-19 18:53:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:53:14,391 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-10-19 18:53:14,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-19 18:53:14,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2020-10-19 18:53:14,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:14,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2020-10-19 18:53:14,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-19 18:53:14,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-19 18:53:14,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2020-10-19 18:53:14,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:53:14,396 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-10-19 18:53:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2020-10-19 18:53:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2020-10-19 18:53:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 18:53:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-10-19 18:53:14,401 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-10-19 18:53:14,402 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-10-19 18:53:14,402 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 18:53:14,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2020-10-19 18:53:14,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:14,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:53:14,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:53:14,407 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2020-10-19 18:53:14,407 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 18:53:14,407 INFO L794 eck$LassoCheckResult]: Stem: 916#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 913#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 914#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 918#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 919#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 920#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 921#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 937#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 936#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 935#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 934#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 933#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 932#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 931#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 930#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 929#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 928#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 927#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 926#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 925#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 924#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 923#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 922#L21-3 assume !(main_~i~0 < 11); 917#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 915#L28-2 [2020-10-19 18:53:14,408 INFO L796 eck$LassoCheckResult]: Loop: 915#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 915#L28-2 [2020-10-19 18:53:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:14,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2020-10-19 18:53:14,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:14,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510545773] [2020-10-19 18:53:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:14,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510545773] [2020-10-19 18:53:14,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265587786] [2020-10-19 18:53:14,585 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:53:14,641 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-19 18:53:14,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:53:14,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-19 18:53:14,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:53:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:14,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:53:14,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2020-10-19 18:53:14,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665915670] [2020-10-19 18:53:14,689 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:53:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 11 times [2020-10-19 18:53:14,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:14,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265820742] [2020-10-19 18:53:14,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:14,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:14,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:14,710 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:14,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:53:14,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-19 18:53:14,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2020-10-19 18:53:14,795 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 14 states. [2020-10-19 18:53:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:53:14,856 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-10-19 18:53:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-19 18:53:14,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2020-10-19 18:53:14,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:14,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2020-10-19 18:53:14,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-19 18:53:14,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-19 18:53:14,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2020-10-19 18:53:14,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:53:14,860 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-10-19 18:53:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2020-10-19 18:53:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-10-19 18:53:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-19 18:53:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-10-19 18:53:14,863 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-10-19 18:53:14,863 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-10-19 18:53:14,863 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 18:53:14,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2020-10-19 18:53:14,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 18:53:14,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:53:14,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:53:14,867 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1] [2020-10-19 18:53:14,867 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 18:53:14,868 INFO L794 eck$LassoCheckResult]: Stem: 1056#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1053#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem9, main_#t~post10, main_#t~mem11, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 1054#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1058#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1059#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1060#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1061#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1079#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1078#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1077#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1076#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1075#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1074#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1073#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1072#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1071#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1070#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1069#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1068#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1067#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1066#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1065#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1064#L21-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1063#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1062#L21-3 assume !(main_~i~0 < 11); 1057#L21-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem9 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem9;havoc main_#t~mem9; 1055#L28-2 [2020-10-19 18:53:14,868 INFO L796 eck$LassoCheckResult]: Loop: 1055#L28-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post10 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post10;havoc main_#t~post10;call main_#t~mem11 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem11;havoc main_#t~mem11; 1055#L28-2 [2020-10-19 18:53:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash -95647583, now seen corresponding path program 11 times [2020-10-19 18:53:14,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:14,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908852314] [2020-10-19 18:53:14,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:14,893 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:14,914 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:14,926 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:14,927 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 12 times [2020-10-19 18:53:14,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:14,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578839020] [2020-10-19 18:53:14,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:14,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:14,945 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:14,946 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:14,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:14,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1329892248, now seen corresponding path program 1 times [2020-10-19 18:53:14,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:53:14,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674143838] [2020-10-19 18:53:14,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:53:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:14,997 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:53:15,028 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:53:15,041 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:53:26,384 WARN L193 SmtUtils]: Spent 11.25 s on a formula simplification. DAG size of input: 259 DAG size of output: 197 [2020-10-19 18:53:27,344 WARN L193 SmtUtils]: Spent 923.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-19 18:53:27,348 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:53:27,348 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:53:27,348 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:53:27,348 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:53:27,348 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:53:27,349 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:27,349 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:53:27,349 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:53:27,349 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration13_Lasso [2020-10-19 18:53:27,349 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:53:27,349 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:53:27,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:27,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:27,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:27,776 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-10-19 18:53:27,898 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-10-19 18:53:27,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:27,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:27,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:27,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:27,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:27,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:27,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:27,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:53:28,177 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-10-19 18:53:28,556 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2020-10-19 18:53:28,596 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:53:28,597 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:28,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:28,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:28,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:28,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:28,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:28,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:28,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:53:28,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:28,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:28,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:28,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:53:28,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:28,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:28,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:28,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:53:28,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:53:28,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:28,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:28,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:28,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:28,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:28,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:28,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:28,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:53:28,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:53:28,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:28,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:28,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:28,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:28,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:28,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:28,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:53:28,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:28,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:28,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:28,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:28,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:28,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:28,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:28,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:53:28,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:53:28,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:28,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:28,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:28,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:28,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:28,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:28,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:28,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:28,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:28,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:28,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:53:28,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:28,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:28,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:28,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:53:28,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:53:28,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:28,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:28,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:28,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:28,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:28,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:28,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:28,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:53:28,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:28,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:28,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:28,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:28,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:28,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:28,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:28,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:53:28,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:28,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:28,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:28,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:53:28,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:28,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:28,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:28,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:53:28,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:53:28,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:28,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:28,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:28,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:28,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:28,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:28,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:28,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:53:28,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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:28,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:53:28,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:53:28,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:53:28,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:53:28,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:53:28,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:53:28,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:53:29,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:53:29,023 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-19 18:53:29,023 INFO L444 ModelExtractionUtils]: 9 out of 19 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:53:29,026 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:53:29,028 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:53:29,028 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:53:29,029 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#in~0.offset, ULTIMATE.start_main_~idx_in~0, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2) = -1*ULTIMATE.start_main_~#in~0.offset - 1*ULTIMATE.start_main_~idx_in~0 + 1*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2 Supporting invariants [] [2020-10-19 18:53:29,091 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-19 18:53:29,093 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:53:29,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:53:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:29,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:53:29,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:53:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:53:29,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:53:29,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:53:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:53:29,155 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-10-19 18:53:29,155 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 2 states. [2020-10-19 18:53:29,160 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3. Second operand 2 states. Result 28 states and 29 transitions. Complement of second has 2 states. [2020-10-19 18:53:29,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2020-10-19 18:53:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-10-19 18:53:29,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2020-10-19 18:53:29,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 1 letters. [2020-10-19 18:53:29,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:53:29,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 27 letters. Loop has 1 letters. [2020-10-19 18:53:29,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:53:29,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2020-10-19 18:53:29,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:53:29,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2020-10-19 18:53:29,165 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:53:29,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2020-10-19 18:53:29,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 18:53:29,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 18:53:29,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 18:53:29,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:53:29,166 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:53:29,166 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:53:29,166 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:53:29,166 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-19 18:53:29,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 18:53:29,166 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:53:29,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 18:53:29,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:53:29 BoogieIcfgContainer [2020-10-19 18:53:29,174 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:53:29,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:53:29,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:53:29,174 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:53:29,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:53:07" (3/4) ... [2020-10-19 18:53:29,179 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 18:53:29,179 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:53:29,181 INFO L168 Benchmark]: Toolchain (without parser) took 22020.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 960.0 MB in the beginning and 832.6 MB in the end (delta: 127.3 MB). Peak memory consumption was 435.1 MB. Max. memory is 11.5 GB. [2020-10-19 18:53:29,181 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:53:29,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.46 ms. Allocated memory is still 1.0 GB. Free memory was 960.0 MB in the beginning and 949.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-10-19 18:53:29,182 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 949.2 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-10-19 18:53:29,183 INFO L168 Benchmark]: Boogie Preprocessor took 28.22 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. [2020-10-19 18:53:29,183 INFO L168 Benchmark]: RCFGBuilder took 298.49 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: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2020-10-19 18:53:29,184 INFO L168 Benchmark]: BuchiAutomizer took 21302.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 840.8 MB in the end (delta: 249.8 MB). Peak memory consumption was 435.9 MB. Max. memory is 11.5 GB. [2020-10-19 18:53:29,185 INFO L168 Benchmark]: Witness Printer took 5.09 ms. Allocated memory is still 1.3 GB. Free memory was 840.8 MB in the beginning and 832.6 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2020-10-19 18:53:29,187 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.46 ms. Allocated memory is still 1.0 GB. Free memory was 960.0 MB in the beginning and 949.2 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 111.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 949.2 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.22 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 298.49 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: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21302.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 840.8 MB in the end (delta: 249.8 MB). Peak memory consumption was 435.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.09 ms. Allocated memory is still 1.3 GB. Free memory was 840.8 MB in the beginning and 832.6 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. 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 21.2s and 14 iterations. TraceHistogramMax:11. Analysis of lassos took 20.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 23 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 12. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 52 SDtfs, 73 SDslu, 48 SDs, 0 SdLazy, 277 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital249 mio100 ax100 hnf99 lsp100 ukn48 mio100 lsp42 div141 bol100 ite100 ukn100 eq161 hnf74 smp97 dnf202 smp75 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...