./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 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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.2.1-dev-20ed64e [2021-08-27 14:38:13,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:38:13,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:38:13,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:38:13,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:38:13,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:38:13,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:38:13,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:38:13,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:38:13,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:38:13,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:38:13,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:38:13,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:38:13,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:38:13,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:38:13,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:38:13,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:38:13,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:38:13,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:38:13,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:38:13,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:38:13,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:38:13,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:38:13,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:38:13,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:38:13,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:38:13,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:38:13,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:38:13,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:38:13,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:38:13,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:38:13,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:38:13,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:38:13,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:38:13,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:38:13,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:38:13,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:38:13,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:38:13,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:38:13,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:38:13,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:38:13,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 14:38:13,559 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:38:13,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:38:13,560 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:38:13,560 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:38:13,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:38:13,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:38:13,562 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:38:13,562 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:38:13,562 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:38:13,562 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:38:13,563 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:38:13,563 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:38:13,563 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:38:13,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:38:13,564 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 14:38:13,564 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:38:13,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:38:13,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 14:38:13,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:38:13,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:38:13,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:38:13,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:38:13,565 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 14:38:13,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:38:13,565 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:38:13,565 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:38:13,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:38:13,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:38:13,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:38:13,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:38:13,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:38:13,566 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:38:13,567 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:38:13,568 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2021-08-27 14:38:13,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:38:13,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:38:13,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:38:13,894 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:38:13,895 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:38:13,896 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 [2021-08-27 14:38:13,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516c6a634/6221b7041c024191ba5cab6117728a75/FLAGfffc7faeb [2021-08-27 14:38:14,304 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:38:14,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2021-08-27 14:38:14,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516c6a634/6221b7041c024191ba5cab6117728a75/FLAGfffc7faeb [2021-08-27 14:38:14,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516c6a634/6221b7041c024191ba5cab6117728a75 [2021-08-27 14:38:14,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:38:14,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:38:14,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:38:14,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:38:14,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:38:14,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:38:14" (1/1) ... [2021-08-27 14:38:14,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae62bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:38:14, skipping insertion in model container [2021-08-27 14:38:14,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:38:14" (1/1) ... [2021-08-27 14:38:14,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:38:14,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:38:14,460 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2021-08-27 14:38:14,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:38:14,476 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:38:14,511 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2021-08-27 14:38:14,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:38:14,533 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:38:14,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:38:14 WrapperNode [2021-08-27 14:38:14,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:38:14,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:38:14,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:38:14,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:38:14,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:38:14" (1/1) ... [2021-08-27 14:38:14,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:38:14" (1/1) ... [2021-08-27 14:38:14,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:38:14,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:38:14,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:38:14,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:38:14,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:38:14" (1/1) ... [2021-08-27 14:38:14,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:38:14" (1/1) ... [2021-08-27 14:38:14,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:38:14" (1/1) ... [2021-08-27 14:38:14,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:38:14" (1/1) ... [2021-08-27 14:38:14,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:38:14" (1/1) ... [2021-08-27 14:38:14,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:38:14" (1/1) ... [2021-08-27 14:38:14,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:38:14" (1/1) ... [2021-08-27 14:38:14,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:38:14,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:38:14,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:38:14,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:38:14,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:38:14" (1/1) ... [2021-08-27 14:38:14,604 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:14,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 14:38:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 14:38:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 14:38:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 14:38:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:38:14,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:38:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 14:38:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 14:38:14,864 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:38:14,864 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-27 14:38:14,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:38:14 BoogieIcfgContainer [2021-08-27 14:38:14,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:38:14,866 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:38:14,866 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:38:14,868 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:38:14,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:38:14,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:38:14" (1/3) ... [2021-08-27 14:38:14,870 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64989b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:38:14, skipping insertion in model container [2021-08-27 14:38:14,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:38:14,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:38:14" (2/3) ... [2021-08-27 14:38:14,870 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64989b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:38:14, skipping insertion in model container [2021-08-27 14:38:14,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:38:14,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:38:14" (3/3) ... [2021-08-27 14:38:14,871 INFO L389 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2021-08-27 14:38:14,898 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:38:14,898 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:38:14,898 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:38:14,898 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:38:14,898 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:38:14,898 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:38:14,899 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:38:14,899 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:38:14,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:14,917 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2021-08-27 14:38:14,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:14,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:14,921 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:38:14,921 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:38:14,921 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:38:14,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:14,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2021-08-27 14:38:14,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:14,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:14,923 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:38:14,923 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:38:14,928 INFO L791 eck$LassoCheckResult]: Stem: 5#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); 8#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; 4#L21-3true [2021-08-27 14:38:14,928 INFO L793 eck$LassoCheckResult]: Loop: 4#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; 12#L21-2true main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 4#L21-3true [2021-08-27 14:38:14,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:14,932 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 14:38:14,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:14,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105032076] [2021-08-27 14:38:14,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:14,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:15,021 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:15,066 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:15,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:15,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-27 14:38:15,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:15,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062241970] [2021-08-27 14:38:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:15,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:15,084 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:15,095 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:15,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:15,096 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-27 14:38:15,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:15,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525348104] [2021-08-27 14:38:15,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:15,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:15,121 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:15,134 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:15,573 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:38:15,574 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:38:15,574 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:38:15,574 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:38:15,574 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:38:15,574 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:15,574 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:38:15,575 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:38:15,575 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration1_Lasso [2021-08-27 14:38:15,575 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:38:15,575 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:38:15,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:15,957 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:38:15,959 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:38:15,961 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:15,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:15,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 14:38:16,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:16,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:16,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:16,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,098 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 14:38:16,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:16,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:38:16,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,137 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-27 14:38:16,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:16,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:16,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:16,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,195 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-27 14:38:16,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:16,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:16,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:16,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,233 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,234 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:16,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-27 14:38:16,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:16,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:16,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,309 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,309 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-27 14:38:16,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:16,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:16,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:16,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,338 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-27 14:38:16,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:16,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:38:16,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,376 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,376 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 14:38:16,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:16,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:16,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:16,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,417 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,418 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 14:38:16,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:16,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:16,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:16,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,457 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,457 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 14:38:16,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:16,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:16,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:16,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,501 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,501 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 14:38:16,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:16,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:16,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:16,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,538 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,538 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 14:38:16,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:16,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:38:16,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,586 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,587 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 14:38:16,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:16,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:16,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:16,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-08-27 14:38:16,616 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,616 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 14:38:16,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:16,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:38:16,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,665 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,666 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 14:38:16,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:16,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:38:16,686 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,702 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,702 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 14:38:16,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:16,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:38:16,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,745 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,746 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 14:38:16,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:16,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:16,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:16,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,783 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,783 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 14:38:16,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:16,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:38:16,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:16,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,812 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,812 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 14:38:16,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:16,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:16,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:16,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:16,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:16,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:16,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:38:16,836 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:38:16,867 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-08-27 14:38:16,867 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-08-27 14:38:16,869 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:16,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,905 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-27 14:38:16,908 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:38:16,934 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 14:38:16,934 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:38:16,934 INFO L515 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 [] [2021-08-27 14:38:16,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:16,983 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-08-27 14:38:17,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:17,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:38:17,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:17,045 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 14:38:17,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:17,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:17,083 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 [2021-08-27 14:38:17,084 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:17,118 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 35 transitions. Complement of second has 8 states. [2021-08-27 14:38:17,119 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 [2021-08-27 14:38:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2021-08-27 14:38:17,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-27 14:38:17,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:38:17,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-27 14:38:17,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:38:17,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-27 14:38:17,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:38:17,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2021-08-27 14:38:17,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:17,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 7 states and 9 transitions. [2021-08-27 14:38:17,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2021-08-27 14:38:17,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2021-08-27 14:38:17,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2021-08-27 14:38:17,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:17,135 INFO L681 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2021-08-27 14:38:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2021-08-27 14:38:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-08-27 14:38:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2021-08-27 14:38:17,150 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2021-08-27 14:38:17,150 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2021-08-27 14:38:17,150 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:38:17,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2021-08-27 14:38:17,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:17,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:17,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:17,151 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-27 14:38:17,151 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 14:38:17,151 INFO L791 eck$LassoCheckResult]: Stem: 126#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); 127#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; 122#L21-3 assume !(main_~i~0 < 11); 123#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; 128#L28-2 [2021-08-27 14:38:17,151 INFO L793 eck$LassoCheckResult]: Loop: 128#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; 128#L28-2 [2021-08-27 14:38:17,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:17,151 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-08-27 14:38:17,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:17,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137847046] [2021-08-27 14:38:17,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:17,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:17,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:17,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:17,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137847046] [2021-08-27 14:38:17,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137847046] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:38:17,216 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:38:17,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:38:17,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858821186] [2021-08-27 14:38:17,218 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:38:17,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:17,218 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2021-08-27 14:38:17,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:17,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370496775] [2021-08-27 14:38:17,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:17,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:17,228 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:17,239 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:17,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:17,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:38:17,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:38:17,353 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:17,365 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2021-08-27 14:38:17,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:38:17,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2021-08-27 14:38:17,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:17,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2021-08-27 14:38:17,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 14:38:17,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 14:38:17,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2021-08-27 14:38:17,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:17,367 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-08-27 14:38:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2021-08-27 14:38:17,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2021-08-27 14:38:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2021-08-27 14:38:17,368 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-08-27 14:38:17,368 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-08-27 14:38:17,368 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:38:17,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2021-08-27 14:38:17,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:17,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:17,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:17,369 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 14:38:17,369 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 14:38:17,369 INFO L791 eck$LassoCheckResult]: Stem: 148#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); 149#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; 144#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; 145#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 146#L21-3 assume !(main_~i~0 < 11); 147#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; 150#L28-2 [2021-08-27 14:38:17,369 INFO L793 eck$LassoCheckResult]: Loop: 150#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; 150#L28-2 [2021-08-27 14:38:17,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:17,370 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-08-27 14:38:17,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:17,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059667148] [2021-08-27 14:38:17,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:17,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:17,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:17,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059667148] [2021-08-27 14:38:17,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059667148] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:17,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163974450] [2021-08-27 14:38:17,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:17,395 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:17,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:17,405 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:17,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-27 14:38:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:17,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 14:38:17,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:17,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163974450] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:17,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:17,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 14:38:17,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155744701] [2021-08-27 14:38:17,498 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:38:17,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:17,498 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2021-08-27 14:38:17,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:17,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786176554] [2021-08-27 14:38:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:17,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:17,505 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:17,510 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:17,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:17,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 14:38:17,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 14:38:17,618 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:17,636 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2021-08-27 14:38:17,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 14:38:17,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2021-08-27 14:38:17,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:17,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2021-08-27 14:38:17,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 14:38:17,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 14:38:17,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2021-08-27 14:38:17,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:17,638 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-08-27 14:38:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2021-08-27 14:38:17,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2021-08-27 14:38:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-08-27 14:38:17,639 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-08-27 14:38:17,639 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-08-27 14:38:17,639 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:38:17,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2021-08-27 14:38:17,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:17,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:17,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:17,640 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2021-08-27 14:38:17,640 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 14:38:17,640 INFO L791 eck$LassoCheckResult]: Stem: 189#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); 190#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; 185#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; 186#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 187#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; 188#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 193#L21-3 assume !(main_~i~0 < 11); 191#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; 192#L28-2 [2021-08-27 14:38:17,640 INFO L793 eck$LassoCheckResult]: Loop: 192#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; 192#L28-2 [2021-08-27 14:38:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2021-08-27 14:38:17,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:17,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2187861] [2021-08-27 14:38:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:17,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:17,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:17,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2187861] [2021-08-27 14:38:17,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2187861] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:17,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366260320] [2021-08-27 14:38:17,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:38:17,677 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:17,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:17,678 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:17,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-08-27 14:38:17,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:38:17,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:38:17,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:38:17,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:17,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366260320] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:17,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:17,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-27 14:38:17,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487356079] [2021-08-27 14:38:17,755 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:38:17,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:17,756 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2021-08-27 14:38:17,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:17,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93958245] [2021-08-27 14:38:17,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:17,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:17,761 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:17,780 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:17,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:17,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 14:38:17,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 14:38:17,877 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:17,894 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2021-08-27 14:38:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 14:38:17,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2021-08-27 14:38:17,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:17,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2021-08-27 14:38:17,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 14:38:17,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 14:38:17,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2021-08-27 14:38:17,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:17,896 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-08-27 14:38:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2021-08-27 14:38:17,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2021-08-27 14:38:17,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2021-08-27 14:38:17,897 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-08-27 14:38:17,897 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-08-27 14:38:17,897 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:38:17,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2021-08-27 14:38:17,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:17,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:17,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:17,898 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2021-08-27 14:38:17,898 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 14:38:17,898 INFO L791 eck$LassoCheckResult]: Stem: 241#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); 242#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; 237#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; 238#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 239#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; 240#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 243#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; 246#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; 245#L28-2 [2021-08-27 14:38:17,898 INFO L793 eck$LassoCheckResult]: Loop: 245#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; 245#L28-2 [2021-08-27 14:38:17,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:17,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2021-08-27 14:38:17,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:17,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566200490] [2021-08-27 14:38:17,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:17,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:17,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:17,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566200490] [2021-08-27 14:38:17,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566200490] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:17,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788424877] [2021-08-27 14:38:17,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:38:17,953 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:17,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:17,957 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:17,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-08-27 14:38:18,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 14:38:18,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:38:18,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 14:38:18,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:18,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788424877] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:18,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:18,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 14:38:18,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055245005] [2021-08-27 14:38:18,042 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:38:18,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:18,042 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2021-08-27 14:38:18,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:18,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512947403] [2021-08-27 14:38:18,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:18,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:18,047 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:18,051 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:18,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:18,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 14:38:18,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 14:38:18,142 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:18,165 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2021-08-27 14:38:18,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 14:38:18,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2021-08-27 14:38:18,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:18,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2021-08-27 14:38:18,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 14:38:18,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 14:38:18,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2021-08-27 14:38:18,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:18,167 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-08-27 14:38:18,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2021-08-27 14:38:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2021-08-27 14:38:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-08-27 14:38:18,168 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-08-27 14:38:18,168 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-08-27 14:38:18,168 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:38:18,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2021-08-27 14:38:18,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:18,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:18,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:18,169 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-08-27 14:38:18,169 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 14:38:18,169 INFO L791 eck$LassoCheckResult]: Stem: 304#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); 305#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; 300#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; 301#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 302#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; 303#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 306#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);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; 309#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; 308#L28-2 [2021-08-27 14:38:18,169 INFO L793 eck$LassoCheckResult]: Loop: 308#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; 308#L28-2 [2021-08-27 14:38:18,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:18,169 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2021-08-27 14:38:18,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:18,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702483201] [2021-08-27 14:38:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:18,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:18,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:18,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702483201] [2021-08-27 14:38:18,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702483201] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:18,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530393702] [2021-08-27 14:38:18,215 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 14:38:18,215 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:18,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:18,237 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:18,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-08-27 14:38:18,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 14:38:18,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:38:18,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 14:38:18,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:18,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530393702] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:18,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:18,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-27 14:38:18,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843714270] [2021-08-27 14:38:18,376 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:38:18,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:18,376 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 5 times [2021-08-27 14:38:18,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:18,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284668263] [2021-08-27 14:38:18,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:18,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:18,382 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:18,386 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:18,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:18,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 14:38:18,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 14:38:18,464 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:18,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:18,487 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2021-08-27 14:38:18,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 14:38:18,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2021-08-27 14:38:18,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:18,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2021-08-27 14:38:18,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 14:38:18,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 14:38:18,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2021-08-27 14:38:18,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:18,488 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-08-27 14:38:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2021-08-27 14:38:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2021-08-27 14:38:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-08-27 14:38:18,490 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-08-27 14:38:18,490 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-08-27 14:38:18,490 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:38:18,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2021-08-27 14:38:18,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:18,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:18,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:18,491 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-08-27 14:38:18,491 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 14:38:18,491 INFO L791 eck$LassoCheckResult]: Stem: 378#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); 379#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; 374#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; 375#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 376#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; 377#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 380#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);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; 383#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; 382#L28-2 [2021-08-27 14:38:18,491 INFO L793 eck$LassoCheckResult]: Loop: 382#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; 382#L28-2 [2021-08-27 14:38:18,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:18,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2021-08-27 14:38:18,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:18,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646557557] [2021-08-27 14:38:18,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:18,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:18,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:18,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646557557] [2021-08-27 14:38:18,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646557557] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:18,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697755411] [2021-08-27 14:38:18,543 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 14:38:18,544 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:18,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:18,557 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:18,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-08-27 14:38:18,685 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-08-27 14:38:18,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:38:18,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 14:38:18,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:18,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697755411] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:18,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:18,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-08-27 14:38:18,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872146556] [2021-08-27 14:38:18,725 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:38:18,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:18,725 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 6 times [2021-08-27 14:38:18,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:18,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401200390] [2021-08-27 14:38:18,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:18,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:18,730 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:18,733 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:18,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:18,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 14:38:18,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 14:38:18,806 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:18,830 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2021-08-27 14:38:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 14:38:18,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2021-08-27 14:38:18,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:18,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2021-08-27 14:38:18,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 14:38:18,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 14:38:18,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2021-08-27 14:38:18,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:18,832 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-08-27 14:38:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2021-08-27 14:38:18,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-08-27 14:38:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-08-27 14:38:18,833 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-08-27 14:38:18,833 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-08-27 14:38:18,833 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 14:38:18,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2021-08-27 14:38:18,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:18,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:18,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:18,834 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2021-08-27 14:38:18,834 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 14:38:18,834 INFO L791 eck$LassoCheckResult]: Stem: 463#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); 464#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; 459#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; 460#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 461#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; 462#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 465#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);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; 468#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; 467#L28-2 [2021-08-27 14:38:18,835 INFO L793 eck$LassoCheckResult]: Loop: 467#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; 467#L28-2 [2021-08-27 14:38:18,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:18,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2021-08-27 14:38:18,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:18,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138942094] [2021-08-27 14:38:18,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:18,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:18,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:18,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138942094] [2021-08-27 14:38:18,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138942094] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:18,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390350155] [2021-08-27 14:38:18,881 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 14:38:18,881 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:18,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:18,892 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:18,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-08-27 14:38:18,969 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-08-27 14:38:18,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:38:18,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 14:38:18,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:19,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390350155] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:19,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:19,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-08-27 14:38:19,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231929190] [2021-08-27 14:38:19,026 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:38:19,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:19,027 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 7 times [2021-08-27 14:38:19,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:19,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663079941] [2021-08-27 14:38:19,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:19,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:19,031 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:19,038 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:19,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:19,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 14:38:19,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 14:38:19,127 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:19,157 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2021-08-27 14:38:19,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 14:38:19,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2021-08-27 14:38:19,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:19,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2021-08-27 14:38:19,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 14:38:19,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 14:38:19,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2021-08-27 14:38:19,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:19,158 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-08-27 14:38:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2021-08-27 14:38:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2021-08-27 14:38:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-08-27 14:38:19,159 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-08-27 14:38:19,159 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-08-27 14:38:19,159 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 14:38:19,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2021-08-27 14:38:19,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:19,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:19,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:19,160 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2021-08-27 14:38:19,160 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 14:38:19,160 INFO L791 eck$LassoCheckResult]: Stem: 559#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); 560#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; 555#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; 556#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 557#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; 558#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 561#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);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; 564#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; 563#L28-2 [2021-08-27 14:38:19,160 INFO L793 eck$LassoCheckResult]: Loop: 563#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; 563#L28-2 [2021-08-27 14:38:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:19,160 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2021-08-27 14:38:19,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:19,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907517301] [2021-08-27 14:38:19,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:19,161 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:19,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:19,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907517301] [2021-08-27 14:38:19,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907517301] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:19,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785740292] [2021-08-27 14:38:19,217 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 14:38:19,217 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:19,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:19,253 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:19,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-08-27 14:38:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:19,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 14:38:19,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:19,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785740292] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:19,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:19,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-08-27 14:38:19,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624621315] [2021-08-27 14:38:19,397 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:38:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:19,397 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 8 times [2021-08-27 14:38:19,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:19,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215980750] [2021-08-27 14:38:19,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:19,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:19,401 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:19,404 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:19,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:19,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 14:38:19,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-08-27 14:38:19,487 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:19,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:19,520 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2021-08-27 14:38:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 14:38:19,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2021-08-27 14:38:19,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:19,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2021-08-27 14:38:19,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 14:38:19,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 14:38:19,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2021-08-27 14:38:19,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:19,522 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-08-27 14:38:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2021-08-27 14:38:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2021-08-27 14:38:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-08-27 14:38:19,523 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-08-27 14:38:19,523 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-08-27 14:38:19,523 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 14:38:19,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2021-08-27 14:38:19,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:19,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:19,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:19,524 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2021-08-27 14:38:19,524 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 14:38:19,525 INFO L791 eck$LassoCheckResult]: Stem: 666#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); 667#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; 662#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; 663#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 664#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; 665#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 668#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);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; 671#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; 670#L28-2 [2021-08-27 14:38:19,525 INFO L793 eck$LassoCheckResult]: Loop: 670#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; 670#L28-2 [2021-08-27 14:38:19,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2021-08-27 14:38:19,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:19,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862072369] [2021-08-27 14:38:19,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:19,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:19,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:19,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862072369] [2021-08-27 14:38:19,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862072369] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:19,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550630885] [2021-08-27 14:38:19,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:38:19,596 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:19,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:19,602 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:19,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-08-27 14:38:19,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:38:19,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:38:19,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 14:38:19,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:19,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550630885] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:19,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:19,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-08-27 14:38:19,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790946357] [2021-08-27 14:38:19,751 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:38:19,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:19,752 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 9 times [2021-08-27 14:38:19,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:19,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68072394] [2021-08-27 14:38:19,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:19,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:19,756 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:19,759 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:19,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:19,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 14:38:19,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-08-27 14:38:19,844 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:19,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:19,877 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2021-08-27 14:38:19,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 14:38:19,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2021-08-27 14:38:19,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:19,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2021-08-27 14:38:19,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 14:38:19,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-08-27 14:38:19,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2021-08-27 14:38:19,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:19,879 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-27 14:38:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2021-08-27 14:38:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2021-08-27 14:38:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-08-27 14:38:19,880 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-08-27 14:38:19,880 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-08-27 14:38:19,880 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 14:38:19,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2021-08-27 14:38:19,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:19,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:19,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:19,881 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2021-08-27 14:38:19,881 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 14:38:19,882 INFO L791 eck$LassoCheckResult]: Stem: 784#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); 785#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; 780#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; 781#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 782#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; 783#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 786#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);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; 789#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; 788#L28-2 [2021-08-27 14:38:19,882 INFO L793 eck$LassoCheckResult]: Loop: 788#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; 788#L28-2 [2021-08-27 14:38:19,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:19,882 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2021-08-27 14:38:19,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:19,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752740366] [2021-08-27 14:38:19,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:19,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:19,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:19,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752740366] [2021-08-27 14:38:19,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752740366] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:19,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908525450] [2021-08-27 14:38:19,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:38:19,956 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:19,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:19,957 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:19,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-08-27 14:38:20,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-08-27 14:38:20,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:38:20,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 14:38:20,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:20,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908525450] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:20,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:20,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2021-08-27 14:38:20,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78710905] [2021-08-27 14:38:20,145 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:38:20,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:20,146 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 10 times [2021-08-27 14:38:20,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:20,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331656884] [2021-08-27 14:38:20,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:20,146 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:20,150 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:20,153 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:20,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:20,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 14:38:20,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-27 14:38:20,248 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:20,288 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2021-08-27 14:38:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 14:38:20,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2021-08-27 14:38:20,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:20,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2021-08-27 14:38:20,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-27 14:38:20,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 14:38:20,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2021-08-27 14:38:20,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:20,291 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-08-27 14:38:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2021-08-27 14:38:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2021-08-27 14:38:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-08-27 14:38:20,292 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-27 14:38:20,292 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-27 14:38:20,292 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 14:38:20,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2021-08-27 14:38:20,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:20,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:20,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:20,293 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2021-08-27 14:38:20,293 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 14:38:20,294 INFO L791 eck$LassoCheckResult]: Stem: 914#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); 915#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; 910#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; 911#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 912#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; 913#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);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 921#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 920#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; 919#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 918#L21-3 assume !(main_~i~0 < 11); 916#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; 917#L28-2 [2021-08-27 14:38:20,294 INFO L793 eck$LassoCheckResult]: Loop: 917#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; 917#L28-2 [2021-08-27 14:38:20,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:20,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2021-08-27 14:38:20,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:20,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130545852] [2021-08-27 14:38:20,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:20,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:20,384 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:20,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:20,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130545852] [2021-08-27 14:38:20,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130545852] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:20,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158186051] [2021-08-27 14:38:20,384 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 14:38:20,385 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:20,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:20,386 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:20,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-08-27 14:38:20,476 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 14:38:20,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:38:20,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 14:38:20,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:20,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158186051] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:20,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:20,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2021-08-27 14:38:20,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247758515] [2021-08-27 14:38:20,549 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:38:20,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:20,550 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 11 times [2021-08-27 14:38:20,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:20,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828976010] [2021-08-27 14:38:20,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:20,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:20,553 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:20,556 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:20,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:20,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 14:38:20,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2021-08-27 14:38:20,638 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:20,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:20,683 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2021-08-27 14:38:20,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 14:38:20,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2021-08-27 14:38:20,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:20,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2021-08-27 14:38:20,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-27 14:38:20,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 14:38:20,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2021-08-27 14:38:20,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:20,687 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-08-27 14:38:20,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2021-08-27 14:38:20,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-08-27 14:38:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-08-27 14:38:20,690 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-08-27 14:38:20,690 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-08-27 14:38:20,690 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 14:38:20,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2021-08-27 14:38:20,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2021-08-27 14:38:20,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:20,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:20,692 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1] [2021-08-27 14:38:20,692 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2021-08-27 14:38:20,692 INFO L791 eck$LassoCheckResult]: Stem: 1054#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); 1055#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; 1050#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; 1051#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1052#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; 1053#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);call write~int(main_#t~nondet8, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1061#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1060#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; 1059#L21-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1058#L21-3 assume !(main_~i~0 < 11); 1056#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; 1057#L28-2 [2021-08-27 14:38:20,692 INFO L793 eck$LassoCheckResult]: Loop: 1057#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; 1057#L28-2 [2021-08-27 14:38:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:20,692 INFO L82 PathProgramCache]: Analyzing trace with hash -95647583, now seen corresponding path program 11 times [2021-08-27 14:38:20,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:20,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591737883] [2021-08-27 14:38:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:20,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:20,706 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:20,730 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:20,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:20,731 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 12 times [2021-08-27 14:38:20,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:20,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474950800] [2021-08-27 14:38:20,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:20,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:20,742 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:20,749 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:20,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:20,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1329892248, now seen corresponding path program 1 times [2021-08-27 14:38:20,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:20,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279374287] [2021-08-27 14:38:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:20,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:20,777 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:20,799 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:29,807 WARN L207 SmtUtils]: Spent 8.93 s on a formula simplification. DAG size of input: 259 DAG size of output: 199 [2021-08-27 14:38:31,283 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:38:31,283 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:38:31,283 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:38:31,283 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:38:31,283 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:38:31,283 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:31,283 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:38:31,283 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:38:31,283 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration13_Lasso [2021-08-27 14:38:31,284 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:38:31,284 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:38:31,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:31,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:31,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:31,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:31,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:31,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:31,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:31,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:31,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:31,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:31,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:32,135 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:38:32,136 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:38:32,136 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:32,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:32,142 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:32,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-08-27 14:38:32,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:32,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:32,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:32,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:32,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:32,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:32,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:38:32,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:32,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-08-27 14:38:32,209 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:32,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:32,210 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:32,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-08-27 14:38:32,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:32,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:32,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:32,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:32,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:32,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:32,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:32,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:32,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:32,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:32,238 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:32,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:32,239 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:32,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-27 14:38:32,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:32,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:32,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:32,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:32,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:32,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:32,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:38:32,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:32,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:32,275 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:32,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:32,276 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:32,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-08-27 14:38:32,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:32,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:32,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:32,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:32,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:32,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:32,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:38:32,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:32,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-08-27 14:38:32,302 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:32,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:32,302 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:32,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-08-27 14:38:32,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:32,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:32,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:32,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:32,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:32,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:32,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:38:32,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:32,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-08-27 14:38:32,328 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:32,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:32,329 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:32,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-08-27 14:38:32,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:32,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:32,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:32,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:32,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:32,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:32,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:38:32,348 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:38:32,356 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-08-27 14:38:32,357 INFO L444 ModelExtractionUtils]: 9 out of 19 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-08-27 14:38:32,357 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:32,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:32,358 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:32,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-08-27 14:38:32,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:38:32,366 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 14:38:32,366 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:38:32,366 INFO L515 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 [] [2021-08-27 14:38:32,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:32,402 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-08-27 14:38:32,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:32,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:38:32,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:32,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:38:32,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:32,504 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 [2021-08-27 14:38:32,504 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:32,509 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 29 transitions. Complement of second has 2 states. [2021-08-27 14:38:32,510 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 [2021-08-27 14:38:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2021-08-27 14:38:32,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 1 letters. [2021-08-27 14:38:32,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:38:32,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 27 letters. Loop has 1 letters. [2021-08-27 14:38:32,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:38:32,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2021-08-27 14:38:32,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:38:32,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2021-08-27 14:38:32,512 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 14:38:32,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2021-08-27 14:38:32,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 14:38:32,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 14:38:32,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 14:38:32,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:32,512 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:38:32,512 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:38:32,512 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:38:32,512 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 14:38:32,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 14:38:32,513 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 14:38:32,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 14:38:32,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 02:38:32 BoogieIcfgContainer [2021-08-27 14:38:32,516 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 14:38:32,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 14:38:32,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 14:38:32,517 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 14:38:32,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:38:14" (3/4) ... [2021-08-27 14:38:32,519 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 14:38:32,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 14:38:32,520 INFO L168 Benchmark]: Toolchain (without parser) took 18193.72 ms. Allocated memory was 60.8 MB in the beginning and 182.5 MB in the end (delta: 121.6 MB). Free memory was 39.6 MB in the beginning and 99.8 MB in the end (delta: -60.2 MB). Peak memory consumption was 60.9 MB. Max. memory is 16.1 GB. [2021-08-27 14:38:32,520 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 60.8 MB. Free memory was 43.1 MB in the beginning and 43.0 MB in the end (delta: 38.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:38:32,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.60 ms. Allocated memory is still 60.8 MB. Free memory was 39.5 MB in the beginning and 44.2 MB in the end (delta: -4.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 14:38:32,521 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.90 ms. Allocated memory is still 60.8 MB. Free memory was 44.2 MB in the beginning and 42.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:38:32,521 INFO L168 Benchmark]: Boogie Preprocessor took 33.73 ms. Allocated memory is still 60.8 MB. Free memory was 42.7 MB in the beginning and 41.6 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:38:32,521 INFO L168 Benchmark]: RCFGBuilder took 268.00 ms. Allocated memory was 60.8 MB in the beginning and 83.9 MB in the end (delta: 23.1 MB). Free memory was 41.5 MB in the beginning and 66.7 MB in the end (delta: -25.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. [2021-08-27 14:38:32,521 INFO L168 Benchmark]: BuchiAutomizer took 17650.27 ms. Allocated memory was 83.9 MB in the beginning and 182.5 MB in the end (delta: 98.6 MB). Free memory was 66.4 MB in the beginning and 99.8 MB in the end (delta: -33.4 MB). Peak memory consumption was 65.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:38:32,521 INFO L168 Benchmark]: Witness Printer took 2.45 ms. Allocated memory is still 182.5 MB. Free memory is still 99.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:38:32,522 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.15 ms. Allocated memory is still 60.8 MB. Free memory was 43.1 MB in the beginning and 43.0 MB in the end (delta: 38.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 205.60 ms. Allocated memory is still 60.8 MB. Free memory was 39.5 MB in the beginning and 44.2 MB in the end (delta: -4.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 27.90 ms. Allocated memory is still 60.8 MB. Free memory was 44.2 MB in the beginning and 42.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.73 ms. Allocated memory is still 60.8 MB. Free memory was 42.7 MB in the beginning and 41.6 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 268.00 ms. Allocated memory was 60.8 MB in the beginning and 83.9 MB in the end (delta: 23.1 MB). Free memory was 41.5 MB in the beginning and 66.7 MB in the end (delta: -25.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 17650.27 ms. Allocated memory was 83.9 MB in the beginning and 182.5 MB in the end (delta: 98.6 MB). Free memory was 66.4 MB in the beginning and 99.8 MB in the end (delta: -33.4 MB). Peak memory consumption was 65.1 MB. Max. memory is 16.1 GB. * Witness Printer took 2.45 ms. Allocated memory is still 182.5 MB. Free memory is still 99.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 21 * unknown-#length-unknown[in] + -2 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * idx_in + unknown-#length-unknown[in] + -1 * 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 17.6s and 14 iterations. TraceHistogramMax:11. Analysis of lassos took 16.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 21.1ms 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, 74 SDslu, 26 SDs, 0 SdLazy, 238 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 215.5ms Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital249 mio100 ax100 hnf100 lsp100 ukn49 mio100 lsp41 div141 bol100 ite100 ukn100 eq161 hnf74 smp97 dnf202 smp75 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms 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! [2021-08-27 14:38:32,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:32,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:32,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2021-08-27 14:38:33,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2021-08-27 14:38:33,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-08-27 14:38:33,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2021-08-27 14:38:33,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-08-27 14:38:33,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2021-08-27 14:38:34,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2021-08-27 14:38:34,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2021-08-27 14:38:34,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-08-27 14:38:34,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...