./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50bdaf600d03af0a677a59daf6a875dbe69c10b2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:26:36,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:26:36,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:26:36,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:26:36,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:26:36,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:26:36,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:26:36,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:26:36,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:26:36,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:26:36,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:26:36,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:26:36,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:26:36,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:26:36,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:26:36,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:26:36,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:26:36,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:26:36,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:26:36,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:26:36,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:26:36,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:26:36,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:26:36,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:26:36,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:26:36,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:26:36,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:26:36,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:26:36,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:26:36,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:26:36,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:26:36,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:26:36,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:26:36,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:26:36,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:26:36,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:26:36,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:26:36,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:26:36,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:26:36,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:26:36,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:26:36,553 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:26:36,586 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:26:36,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:26:36,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:26:36,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:26:36,588 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:26:36,589 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:26:36,589 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:26:36,589 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:26:36,589 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:26:36,590 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:26:36,590 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:26:36,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:26:36,590 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:26:36,590 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:26:36,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:26:36,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:26:36,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:26:36,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:26:36,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:26:36,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:26:36,592 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:26:36,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:26:36,592 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:26:36,593 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:26:36,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:26:36,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:26:36,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:26:36,594 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:26:36,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:26:36,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:26:36,594 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:26:36,594 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:26:36,596 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:26:36,596 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 50bdaf600d03af0a677a59daf6a875dbe69c10b2 [2020-07-29 03:26:36,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:26:36,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:26:36,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:26:36,915 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:26:36,915 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:26:36,916 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i [2020-07-29 03:26:37,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9582b87b3/942b787823f341fa906b221e4cf20742/FLAG3da6adf64 [2020-07-29 03:26:37,559 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:26:37,560 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i [2020-07-29 03:26:37,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9582b87b3/942b787823f341fa906b221e4cf20742/FLAG3da6adf64 [2020-07-29 03:26:37,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9582b87b3/942b787823f341fa906b221e4cf20742 [2020-07-29 03:26:37,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:26:37,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:26:37,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:37,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:26:37,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:26:37,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:37" (1/1) ... [2020-07-29 03:26:37,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d44add4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:37, skipping insertion in model container [2020-07-29 03:26:37,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:37" (1/1) ... [2020-07-29 03:26:37,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:26:37,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:26:38,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:38,314 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:26:38,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:38,429 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:26:38,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:38 WrapperNode [2020-07-29 03:26:38,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:38,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:38,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:26:38,433 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:26:38,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:38" (1/1) ... [2020-07-29 03:26:38,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:38" (1/1) ... [2020-07-29 03:26:38,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:38,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:26:38,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:26:38,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:26:38,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:38" (1/1) ... [2020-07-29 03:26:38,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:38" (1/1) ... [2020-07-29 03:26:38,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:38" (1/1) ... [2020-07-29 03:26:38,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:38" (1/1) ... [2020-07-29 03:26:38,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:38" (1/1) ... [2020-07-29 03:26:38,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:38" (1/1) ... [2020-07-29 03:26:38,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:38" (1/1) ... [2020-07-29 03:26:38,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:26:38,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:26:38,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:26:38,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:26:38,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:26:38,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:26:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:26:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:26:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:26:38,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:26:39,015 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:26:39,016 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 03:26:39,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:39 BoogieIcfgContainer [2020-07-29 03:26:39,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:26:39,020 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:26:39,021 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:26:39,024 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:26:39,025 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:39,026 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:26:37" (1/3) ... [2020-07-29 03:26:39,027 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@394b4542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:39, skipping insertion in model container [2020-07-29 03:26:39,028 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:39,028 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:38" (2/3) ... [2020-07-29 03:26:39,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@394b4542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:39, skipping insertion in model container [2020-07-29 03:26:39,029 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:39,029 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:39" (3/3) ... [2020-07-29 03:26:39,031 INFO L371 chiAutomizerObserver]: Analyzing ICFG strreplace-alloca-2.i [2020-07-29 03:26:39,080 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:26:39,080 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:26:39,080 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:26:39,081 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:26:39,081 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:26:39,081 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:26:39,081 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:26:39,081 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:26:39,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 03:26:39,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:39,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,124 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:26:39,124 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:39,124 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:26:39,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 03:26:39,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:39,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,129 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:26:39,129 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:39,137 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; 17#L528true assume !(main_~length1~0 < 1); 5#L528-2true call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 12#L533-3true [2020-07-29 03:26:39,137 INFO L796 eck$LassoCheckResult]: Loop: 12#L533-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet9, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet9; 11#L533-2true main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 12#L533-3true [2020-07-29 03:26:39,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,144 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 03:26:39,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067549348] [2020-07-29 03:26:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,256 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,292 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:39,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-07-29 03:26:39,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588615336] [2020-07-29 03:26:39,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,320 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:39,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,323 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-07-29 03:26:39,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152413550] [2020-07-29 03:26:39,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,372 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,389 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,394 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:39,605 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-07-29 03:26:39,691 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:39,692 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:39,692 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:39,693 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:39,693 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:39,693 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:39,693 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:39,693 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:39,694 INFO L133 ssoRankerPreferences]: Filename of dumped script: strreplace-alloca-2.i_Iteration1_Lasso [2020-07-29 03:26:39,694 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:39,694 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:39,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:39,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:39,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:39,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:39,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:39,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:39,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:39,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:39,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:39,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:39,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:39,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:40,525 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:40,530 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:40,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:40,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:40,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:40,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:40,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:40,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:40,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:40,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:40,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:40,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:40,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:40,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:40,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:40,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:40,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:40,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:40,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:40,612 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:40,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:40,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:40,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:40,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:40,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:40,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:40,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:40,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:40,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:40,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:40,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:40,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:40,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:40,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:40,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:40,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:40,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:40,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:40,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:40,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:40,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:40,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:40,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:40,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:40,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:40,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:40,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:40,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:40,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:40,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:40,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:40,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:40,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:40,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:40,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:40,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:40,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:40,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:40,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:40,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:40,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:40,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:40,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:40,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:40,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:40,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:40,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:40,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:40,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:40,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:40,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:40,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:40,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:40,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:40,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:40,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:40,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:40,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:40,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:40,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:40,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:40,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:40,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:40,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:40,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:40,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:40,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:40,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:40,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:40,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:40,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:40,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:40,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:40,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:40,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:40,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:41,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:41,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:41,050 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:41,155 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 03:26:41,156 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:41,219 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:41,220 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:41,221 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-29 03:26:41,275 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 03:26:41,283 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet9, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet9;" "main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8;" [2020-07-29 03:26:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:41,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:41,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:41,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:41,356 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2020-07-29 03:26:41,357 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; {26#unseeded} is VALID [2020-07-29 03:26:41,357 INFO L280 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~length1~0 < 1); {26#unseeded} is VALID [2020-07-29 03:26:41,360 INFO L280 TraceCheckUtils]: 3: Hoare triple {26#unseeded} call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; {26#unseeded} is VALID [2020-07-29 03:26:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:41,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:41,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:41,397 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#(>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet9, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet9; {68#(and (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} is VALID [2020-07-29 03:26:41,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#(and (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; {54#(or (and (> oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:26:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:41,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:41,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:41,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:41,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,433 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:26:41,434 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2020-07-29 03:26:41,610 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 51 transitions. Complement of second has 7 states. [2020-07-29 03:26:41,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:41,610 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:41,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 03:26:41,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:41,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:41,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:41,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:41,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:41,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:41,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:41,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 51 transitions. [2020-07-29 03:26:41,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:41,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:41,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:41,624 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states. [2020-07-29 03:26:41,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:41,628 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:26:41,629 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:41,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:41,634 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:41,634 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 51 transitions. cyclomatic complexity: 17 [2020-07-29 03:26:41,635 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:26:41,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:41,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:41,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:41,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:41,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:41,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:41,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:41,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:41,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:41,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:26:41,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:26:41,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:26:41,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:26:41,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:26:41,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:26:41,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:41,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:41,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:41,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:26:41,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:26:41,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:26:41,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:41,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:41,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:41,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:41,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:41,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:41,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:41,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:41,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:41,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:41,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:41,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:41,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:41,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:41,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:41,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:41,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:41,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:41,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:41,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:41,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:41,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:26:41,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:26:41,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:26:41,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:41,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:41,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:41,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:41,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:41,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:41,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:41,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:41,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 51 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:41,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,655 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 03:26:41,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:41,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:41,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:41,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:41,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 51 transitions. cyclomatic complexity: 17 [2020-07-29 03:26:41,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:41,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 16 transitions. [2020-07-29 03:26:41,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 03:26:41,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 03:26:41,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2020-07-29 03:26:41,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:41,673 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 03:26:41,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2020-07-29 03:26:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 03:26:41,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:41,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 03:26:41,703 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 03:26:41,706 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 03:26:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:41,711 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 03:26:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 03:26:41,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:41,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:41,713 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states and 16 transitions. [2020-07-29 03:26:41,713 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states and 16 transitions. [2020-07-29 03:26:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:41,714 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 03:26:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 03:26:41,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:41,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:41,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:41,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 03:26:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-29 03:26:41,718 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 03:26:41,718 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 03:26:41,718 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:26:41,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 03:26:41,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:41,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:41,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:41,720 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:26:41,720 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:26:41,720 INFO L794 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 122#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; 123#L528 assume !(main_~length1~0 < 1); 126#L528-2 call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 127#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 131#L533-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrreplace_#in~s.base, cstrreplace_#in~s.offset, cstrreplace_#in~old, cstrreplace_#in~new := main_~nondetString1~0.base, main_~nondetString1~0.offset, (if main_#t~nondet10 % 256 <= 127 then main_#t~nondet10 % 256 else main_#t~nondet10 % 256 - 256), (if main_#t~nondet11 % 256 <= 127 then main_#t~nondet11 % 256 else main_#t~nondet11 % 256 - 256);havoc cstrreplace_#res;havoc cstrreplace_#t~mem3, cstrreplace_#t~post4, cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset, cstrreplace_#t~mem2, cstrreplace_~s.base, cstrreplace_~s.offset, cstrreplace_~old, cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, cstrreplace_~numReplaced~0;cstrreplace_~s.base, cstrreplace_~s.offset := cstrreplace_#in~s.base, cstrreplace_#in~s.offset;cstrreplace_~old := cstrreplace_#in~old;cstrreplace_~new := cstrreplace_#in~new;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_~s.base, cstrreplace_~s.offset;cstrreplace_~numReplaced~0 := 0; 125#L517-3 [2020-07-29 03:26:41,721 INFO L796 eck$LassoCheckResult]: Loop: 125#L517-3 call cstrreplace_#t~mem2 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 120#L517-1 assume !!(0 != cstrreplace_#t~mem2);havoc cstrreplace_#t~mem2;call cstrreplace_#t~mem3 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 121#L518 assume cstrreplace_#t~mem3 == cstrreplace_~old;havoc cstrreplace_#t~mem3;call write~int(cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);cstrreplace_#t~post4 := cstrreplace_~numReplaced~0;cstrreplace_~numReplaced~0 := 1 + cstrreplace_#t~post4;havoc cstrreplace_#t~post4; 124#L518-2 cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset := cstrreplace_~p~0.base, cstrreplace_~p~0.offset;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_#t~post5.base, 1 + cstrreplace_#t~post5.offset;havoc cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset; 125#L517-3 [2020-07-29 03:26:41,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:41,721 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-07-29 03:26:41,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:41,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33836156] [2020-07-29 03:26:41,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:41,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:41,764 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:41,769 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:41,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:41,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1790538, now seen corresponding path program 1 times [2020-07-29 03:26:41,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:41,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306694917] [2020-07-29 03:26:41,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:41,790 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:41,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:41,809 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:41,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:41,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1952978730, now seen corresponding path program 1 times [2020-07-29 03:26:41,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:41,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374734333] [2020-07-29 03:26:41,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:42,058 INFO L280 TraceCheckUtils]: 0: Hoare triple {163#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {163#true} is VALID [2020-07-29 03:26:42,058 INFO L280 TraceCheckUtils]: 1: Hoare triple {163#true} havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; {163#true} is VALID [2020-07-29 03:26:42,059 INFO L280 TraceCheckUtils]: 2: Hoare triple {163#true} assume !(main_~length1~0 < 1); {165#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:26:42,060 INFO L280 TraceCheckUtils]: 3: Hoare triple {165#(<= 1 ULTIMATE.start_main_~length1~0)} call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; {166#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (or (= 0 ULTIMATE.start_main_~i~0) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:26:42,062 INFO L280 TraceCheckUtils]: 4: Hoare triple {166#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (or (= 0 ULTIMATE.start_main_~i~0) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !(main_~i~0 < main_~length1~0 - 1); {167#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} is VALID [2020-07-29 03:26:42,064 INFO L280 TraceCheckUtils]: 5: Hoare triple {167#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrreplace_#in~s.base, cstrreplace_#in~s.offset, cstrreplace_#in~old, cstrreplace_#in~new := main_~nondetString1~0.base, main_~nondetString1~0.offset, (if main_#t~nondet10 % 256 <= 127 then main_#t~nondet10 % 256 else main_#t~nondet10 % 256 - 256), (if main_#t~nondet11 % 256 <= 127 then main_#t~nondet11 % 256 else main_#t~nondet11 % 256 - 256);havoc cstrreplace_#res;havoc cstrreplace_#t~mem3, cstrreplace_#t~post4, cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset, cstrreplace_#t~mem2, cstrreplace_~s.base, cstrreplace_~s.offset, cstrreplace_~old, cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, cstrreplace_~numReplaced~0;cstrreplace_~s.base, cstrreplace_~s.offset := cstrreplace_#in~s.base, cstrreplace_#in~s.offset;cstrreplace_~old := cstrreplace_#in~old;cstrreplace_~new := cstrreplace_#in~new;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_~s.base, cstrreplace_~s.offset;cstrreplace_~numReplaced~0 := 0; {168#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrreplace_~p~0.base) ULTIMATE.start_cstrreplace_~p~0.offset))} is VALID [2020-07-29 03:26:42,065 INFO L280 TraceCheckUtils]: 6: Hoare triple {168#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrreplace_~p~0.base) ULTIMATE.start_cstrreplace_~p~0.offset))} call cstrreplace_#t~mem2 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); {169#(= |ULTIMATE.start_cstrreplace_#t~mem2| 0)} is VALID [2020-07-29 03:26:42,066 INFO L280 TraceCheckUtils]: 7: Hoare triple {169#(= |ULTIMATE.start_cstrreplace_#t~mem2| 0)} assume !!(0 != cstrreplace_#t~mem2);havoc cstrreplace_#t~mem2;call cstrreplace_#t~mem3 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); {164#false} is VALID [2020-07-29 03:26:42,066 INFO L280 TraceCheckUtils]: 8: Hoare triple {164#false} assume cstrreplace_#t~mem3 == cstrreplace_~old;havoc cstrreplace_#t~mem3;call write~int(cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);cstrreplace_#t~post4 := cstrreplace_~numReplaced~0;cstrreplace_~numReplaced~0 := 1 + cstrreplace_#t~post4;havoc cstrreplace_#t~post4; {164#false} is VALID [2020-07-29 03:26:42,066 INFO L280 TraceCheckUtils]: 9: Hoare triple {164#false} cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset := cstrreplace_~p~0.base, cstrreplace_~p~0.offset;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_#t~post5.base, 1 + cstrreplace_#t~post5.offset;havoc cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset; {164#false} is VALID [2020-07-29 03:26:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:42,068 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374734333] [2020-07-29 03:26:42,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:42,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 03:26:42,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123228139] [2020-07-29 03:26:42,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:42,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 03:26:42,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-29 03:26:42,134 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-07-29 03:26:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:42,311 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-07-29 03:26:42,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:26:42,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:26:42,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:42,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2020-07-29 03:26:42,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:42,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 13 states and 16 transitions. [2020-07-29 03:26:42,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 03:26:42,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 03:26:42,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2020-07-29 03:26:42,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:42,339 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-07-29 03:26:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2020-07-29 03:26:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-07-29 03:26:42,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:42,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 16 transitions. Second operand 12 states. [2020-07-29 03:26:42,341 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 16 transitions. Second operand 12 states. [2020-07-29 03:26:42,341 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 12 states. [2020-07-29 03:26:42,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:42,343 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 03:26:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2020-07-29 03:26:42,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:42,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:42,344 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 13 states and 16 transitions. [2020-07-29 03:26:42,344 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 13 states and 16 transitions. [2020-07-29 03:26:42,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:42,346 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 03:26:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2020-07-29 03:26:42,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:42,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:42,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:42,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 03:26:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-07-29 03:26:42,349 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-29 03:26:42,349 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-29 03:26:42,349 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:26:42,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2020-07-29 03:26:42,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:42,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:42,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:42,351 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:42,351 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:26:42,351 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 190#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; 191#L528 assume !(main_~length1~0 < 1); 196#L528-2 call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 197#L533-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet9, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet9; 199#L533-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 200#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 201#L533-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrreplace_#in~s.base, cstrreplace_#in~s.offset, cstrreplace_#in~old, cstrreplace_#in~new := main_~nondetString1~0.base, main_~nondetString1~0.offset, (if main_#t~nondet10 % 256 <= 127 then main_#t~nondet10 % 256 else main_#t~nondet10 % 256 - 256), (if main_#t~nondet11 % 256 <= 127 then main_#t~nondet11 % 256 else main_#t~nondet11 % 256 - 256);havoc cstrreplace_#res;havoc cstrreplace_#t~mem3, cstrreplace_#t~post4, cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset, cstrreplace_#t~mem2, cstrreplace_~s.base, cstrreplace_~s.offset, cstrreplace_~old, cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, cstrreplace_~numReplaced~0;cstrreplace_~s.base, cstrreplace_~s.offset := cstrreplace_#in~s.base, cstrreplace_#in~s.offset;cstrreplace_~old := cstrreplace_#in~old;cstrreplace_~new := cstrreplace_#in~new;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_~s.base, cstrreplace_~s.offset;cstrreplace_~numReplaced~0 := 0; 195#L517-3 [2020-07-29 03:26:42,352 INFO L796 eck$LassoCheckResult]: Loop: 195#L517-3 call cstrreplace_#t~mem2 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 192#L517-1 assume !!(0 != cstrreplace_#t~mem2);havoc cstrreplace_#t~mem2;call cstrreplace_#t~mem3 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 193#L518 assume cstrreplace_#t~mem3 == cstrreplace_~old;havoc cstrreplace_#t~mem3;call write~int(cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);cstrreplace_#t~post4 := cstrreplace_~numReplaced~0;cstrreplace_~numReplaced~0 := 1 + cstrreplace_#t~post4;havoc cstrreplace_#t~post4; 194#L518-2 cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset := cstrreplace_~p~0.base, cstrreplace_~p~0.offset;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_#t~post5.base, 1 + cstrreplace_#t~post5.offset;havoc cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset; 195#L517-3 [2020-07-29 03:26:42,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:42,352 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-07-29 03:26:42,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:42,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932798038] [2020-07-29 03:26:42,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,371 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,393 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:42,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:42,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1790538, now seen corresponding path program 2 times [2020-07-29 03:26:42,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:42,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967330459] [2020-07-29 03:26:42,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,400 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,405 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,407 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:42,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:42,408 INFO L82 PathProgramCache]: Analyzing trace with hash -357903304, now seen corresponding path program 1 times [2020-07-29 03:26:42,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:42,409 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947918710] [2020-07-29 03:26:42,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,431 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,468 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:42,876 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2020-07-29 03:26:43,735 WARN L193 SmtUtils]: Spent 732.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-07-29 03:26:43,742 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:43,742 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:43,742 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:43,742 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:43,742 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:43,743 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:43,743 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:43,743 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:43,743 INFO L133 ssoRankerPreferences]: Filename of dumped script: strreplace-alloca-2.i_Iteration3_Lasso [2020-07-29 03:26:43,743 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:43,743 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:43,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:43,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:43,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:43,930 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-07-29 03:26:44,859 WARN L193 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2020-07-29 03:26:44,941 WARN L257 bleTransFormulaUtils]: 4 quantified variables [2020-07-29 03:26:44,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:46,004 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2020-07-29 03:26:46,182 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:46,182 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:46,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:46,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:46,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:46,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:46,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:46,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:46,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:46,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:46,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:46,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:46,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:46,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:46,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:46,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:46,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,314 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 03:26:46,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,318 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-07-29 03:26:46,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:46,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:46,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:46,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:46,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:46,382 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:46,423 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-07-29 03:26:46,423 INFO L444 ModelExtractionUtils]: 7 out of 31 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,426 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:46,428 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:26:46,428 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:46,428 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrreplace_~p~0.offset) = -2*ULTIMATE.start_cstrreplace_~p~0.offset + 3 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_2 + 2 >= 0] [2020-07-29 03:26:46,486 INFO L297 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:26:46,494 INFO L393 LassoCheck]: Loop: "call cstrreplace_#t~mem2 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);" "assume !!(0 != cstrreplace_#t~mem2);havoc cstrreplace_#t~mem2;call cstrreplace_#t~mem3 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);" "assume cstrreplace_#t~mem3 == cstrreplace_~old;havoc cstrreplace_#t~mem3;call write~int(cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);cstrreplace_#t~post4 := cstrreplace_~numReplaced~0;cstrreplace_~numReplaced~0 := 1 + cstrreplace_#t~post4;havoc cstrreplace_#t~post4;" "cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset := cstrreplace_~p~0.base, cstrreplace_~p~0.offset;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_#t~post5.base, 1 + cstrreplace_#t~post5.offset;havoc cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset;" [2020-07-29 03:26:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:46,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:46,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 03:26:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:46,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:46,594 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 03:26:46,595 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:46,602 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:46,603 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:26:46,603 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2020-07-29 03:26:46,606 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:46,607 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_46|]. (and (= |#length| (store |v_#length_46| |ULTIMATE.start_main_#t~malloc7.base| ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded) [2020-07-29 03:26:46,607 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc7.base|)) (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded) [2020-07-29 03:26:46,755 INFO L280 TraceCheckUtils]: 0: Hoare triple {237#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {237#unseeded} is VALID [2020-07-29 03:26:46,756 INFO L280 TraceCheckUtils]: 1: Hoare triple {237#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; {237#unseeded} is VALID [2020-07-29 03:26:46,756 INFO L280 TraceCheckUtils]: 2: Hoare triple {237#unseeded} assume !(main_~length1~0 < 1); {237#unseeded} is VALID [2020-07-29 03:26:46,757 INFO L280 TraceCheckUtils]: 3: Hoare triple {237#unseeded} call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; {300#(and (<= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc7.base|)) (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} is VALID [2020-07-29 03:26:46,758 INFO L280 TraceCheckUtils]: 4: Hoare triple {300#(and (<= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc7.base|)) (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet9, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet9; {300#(and (<= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc7.base|)) (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} is VALID [2020-07-29 03:26:46,759 INFO L280 TraceCheckUtils]: 5: Hoare triple {300#(and (<= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc7.base|)) (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; {307#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc7.base|)) (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 03:26:46,760 INFO L280 TraceCheckUtils]: 6: Hoare triple {307#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc7.base|)) (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < main_~length1~0 - 1); {311#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) 2) (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} is VALID [2020-07-29 03:26:46,762 INFO L280 TraceCheckUtils]: 7: Hoare triple {311#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) 2) (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrreplace_#in~s.base, cstrreplace_#in~s.offset, cstrreplace_#in~old, cstrreplace_#in~new := main_~nondetString1~0.base, main_~nondetString1~0.offset, (if main_#t~nondet10 % 256 <= 127 then main_#t~nondet10 % 256 else main_#t~nondet10 % 256 - 256), (if main_#t~nondet11 % 256 <= 127 then main_#t~nondet11 % 256 else main_#t~nondet11 % 256 - 256);havoc cstrreplace_#res;havoc cstrreplace_#t~mem3, cstrreplace_#t~post4, cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset, cstrreplace_#t~mem2, cstrreplace_~s.base, cstrreplace_~s.offset, cstrreplace_~old, cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, cstrreplace_~numReplaced~0;cstrreplace_~s.base, cstrreplace_~s.offset := cstrreplace_#in~s.base, cstrreplace_#in~s.offset;cstrreplace_~old := cstrreplace_#in~old;cstrreplace_~new := cstrreplace_#in~new;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_~s.base, cstrreplace_~s.offset;cstrreplace_~numReplaced~0 := 0; {282#(and (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc7.base|)) 2) 0) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} is VALID [2020-07-29 03:26:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:46,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:26:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:46,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:46,821 INFO L280 TraceCheckUtils]: 0: Hoare triple {283#(and (>= oldRank0 (+ (* (- 2) ULTIMATE.start_cstrreplace_~p~0.offset) 3)) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc7.base|)) 2) 0) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} call cstrreplace_#t~mem2 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); {315#(and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) (select |#length| ULTIMATE.start_cstrreplace_~p~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) 2) (<= 3 (+ oldRank0 (* 2 ULTIMATE.start_cstrreplace_~p~0.offset))) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} is VALID [2020-07-29 03:26:46,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {315#(and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) (select |#length| ULTIMATE.start_cstrreplace_~p~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) 2) (<= 3 (+ oldRank0 (* 2 ULTIMATE.start_cstrreplace_~p~0.offset))) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} assume !!(0 != cstrreplace_#t~mem2);havoc cstrreplace_#t~mem2;call cstrreplace_#t~mem3 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); {315#(and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) (select |#length| ULTIMATE.start_cstrreplace_~p~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) 2) (<= 3 (+ oldRank0 (* 2 ULTIMATE.start_cstrreplace_~p~0.offset))) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} is VALID [2020-07-29 03:26:46,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {315#(and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) (select |#length| ULTIMATE.start_cstrreplace_~p~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) 2) (<= 3 (+ oldRank0 (* 2 ULTIMATE.start_cstrreplace_~p~0.offset))) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} assume cstrreplace_#t~mem3 == cstrreplace_~old;havoc cstrreplace_#t~mem3;call write~int(cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);cstrreplace_#t~post4 := cstrreplace_~numReplaced~0;cstrreplace_~numReplaced~0 := 1 + cstrreplace_#t~post4;havoc cstrreplace_#t~post4; {315#(and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) (select |#length| ULTIMATE.start_cstrreplace_~p~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) 2) (<= 3 (+ oldRank0 (* 2 ULTIMATE.start_cstrreplace_~p~0.offset))) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} is VALID [2020-07-29 03:26:46,824 INFO L280 TraceCheckUtils]: 3: Hoare triple {315#(and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) (select |#length| ULTIMATE.start_cstrreplace_~p~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) 2) (<= 3 (+ oldRank0 (* 2 ULTIMATE.start_cstrreplace_~p~0.offset))) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset := cstrreplace_~p~0.base, cstrreplace_~p~0.offset;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_#t~post5.base, 1 + cstrreplace_#t~post5.offset;havoc cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset; {285#(and (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc7.base|)) 2) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_cstrreplace_~p~0.offset) 3))) unseeded) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} is VALID [2020-07-29 03:26:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:46,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:26:46,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:46,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:46,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:46,844 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2020-07-29 03:26:46,844 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-07-29 03:26:47,074 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 26 states and 33 transitions. Complement of second has 9 states. [2020-07-29 03:26:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2020-07-29 03:26:47,074 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:47,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2020-07-29 03:26:47,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:47,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:47,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 03:26:47,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:47,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:47,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:47,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2020-07-29 03:26:47,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:47,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:47,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:47,079 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2020-07-29 03:26:47,080 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:26:47,080 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 03:26:47,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:47,082 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:47,082 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 33 transitions. cyclomatic complexity: 10 [2020-07-29 03:26:47,083 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:26:47,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:47,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:47,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:47,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:47,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:47,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:47,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:47,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:47,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:47,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:47,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:47,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:47,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2020-07-29 03:26:47,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 03:26:47,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 12 letters. [2020-07-29 03:26:47,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:26:47,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:26:47,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:26:47,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:47,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:47,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:47,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:47,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:47,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:47,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:47,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:47,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:47,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:47,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:47,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:47,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:47,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:47,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:47,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:47,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:47,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:47,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:26:47,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:26:47,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:26:47,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:47,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:47,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:47,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:47,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:47,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:47,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,104 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 03:26:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-07-29 03:26:47,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:47,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:47,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:26:47,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. cyclomatic complexity: 10 [2020-07-29 03:26:47,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:47,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 17 states and 20 transitions. [2020-07-29 03:26:47,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 03:26:47,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:26:47,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2020-07-29 03:26:47,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:47,111 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 03:26:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2020-07-29 03:26:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2020-07-29 03:26:47,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:47,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 20 transitions. Second operand 14 states. [2020-07-29 03:26:47,113 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 20 transitions. Second operand 14 states. [2020-07-29 03:26:47,113 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 14 states. [2020-07-29 03:26:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:47,115 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-07-29 03:26:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-07-29 03:26:47,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:47,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:47,116 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 17 states and 20 transitions. [2020-07-29 03:26:47,116 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 17 states and 20 transitions. [2020-07-29 03:26:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:47,118 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-07-29 03:26:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-07-29 03:26:47,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:47,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:47,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:47,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 03:26:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-07-29 03:26:47,121 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-29 03:26:47,121 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-29 03:26:47,121 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:26:47,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2020-07-29 03:26:47,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:47,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:47,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:47,123 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:47,123 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:26:47,123 INFO L794 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 371#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; 372#L528 assume !(main_~length1~0 < 1); 377#L528-2 call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 378#L533-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet9, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet9; 380#L533-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 381#L533-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet9, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet9; 382#L533-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 384#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 383#L533-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrreplace_#in~s.base, cstrreplace_#in~s.offset, cstrreplace_#in~old, cstrreplace_#in~new := main_~nondetString1~0.base, main_~nondetString1~0.offset, (if main_#t~nondet10 % 256 <= 127 then main_#t~nondet10 % 256 else main_#t~nondet10 % 256 - 256), (if main_#t~nondet11 % 256 <= 127 then main_#t~nondet11 % 256 else main_#t~nondet11 % 256 - 256);havoc cstrreplace_#res;havoc cstrreplace_#t~mem3, cstrreplace_#t~post4, cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset, cstrreplace_#t~mem2, cstrreplace_~s.base, cstrreplace_~s.offset, cstrreplace_~old, cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, cstrreplace_~numReplaced~0;cstrreplace_~s.base, cstrreplace_~s.offset := cstrreplace_#in~s.base, cstrreplace_#in~s.offset;cstrreplace_~old := cstrreplace_#in~old;cstrreplace_~new := cstrreplace_#in~new;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_~s.base, cstrreplace_~s.offset;cstrreplace_~numReplaced~0 := 0; 376#L517-3 [2020-07-29 03:26:47,123 INFO L796 eck$LassoCheckResult]: Loop: 376#L517-3 call cstrreplace_#t~mem2 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 373#L517-1 assume !!(0 != cstrreplace_#t~mem2);havoc cstrreplace_#t~mem2;call cstrreplace_#t~mem3 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 374#L518 assume cstrreplace_#t~mem3 == cstrreplace_~old;havoc cstrreplace_#t~mem3;call write~int(cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);cstrreplace_#t~post4 := cstrreplace_~numReplaced~0;cstrreplace_~numReplaced~0 := 1 + cstrreplace_#t~post4;havoc cstrreplace_#t~post4; 375#L518-2 cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset := cstrreplace_~p~0.base, cstrreplace_~p~0.offset;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_#t~post5.base, 1 + cstrreplace_#t~post5.offset;havoc cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset; 376#L517-3 [2020-07-29 03:26:47,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:47,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2020-07-29 03:26:47,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:47,125 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955185728] [2020-07-29 03:26:47,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:47,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:47,155 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:47,159 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:47,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:47,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1790538, now seen corresponding path program 3 times [2020-07-29 03:26:47,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:47,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311869761] [2020-07-29 03:26:47,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:47,166 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:47,170 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:47,172 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:47,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:47,173 INFO L82 PathProgramCache]: Analyzing trace with hash -793743590, now seen corresponding path program 2 times [2020-07-29 03:26:47,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:47,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916109927] [2020-07-29 03:26:47,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:47,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:47,230 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:47,240 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:47,755 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2020-07-29 03:26:48,852 WARN L193 SmtUtils]: Spent 945.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-07-29 03:26:48,861 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:48,861 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:48,861 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:48,861 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:48,861 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:48,861 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:48,862 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:48,862 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:48,862 INFO L133 ssoRankerPreferences]: Filename of dumped script: strreplace-alloca-2.i_Iteration4_Lasso [2020-07-29 03:26:48,862 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:48,862 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:48,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:49,013 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-07-29 03:26:49,717 WARN L193 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2020-07-29 03:26:49,776 WARN L257 bleTransFormulaUtils]: 8 quantified variables [2020-07-29 03:26:49,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:49,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:49,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:49,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:50,604 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2020-07-29 03:26:50,831 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2020-07-29 03:26:50,976 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:50,976 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:50,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:50,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:50,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:50,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:50,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:50,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:50,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:50,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:50,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:51,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:51,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:51,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:51,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:51,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:51,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:51,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:51,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:51,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:51,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:51,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:51,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:51,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:51,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:51,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:51,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:51,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:51,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:51,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:51,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:51,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:51,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:51,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:51,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:51,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:51,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:51,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:51,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:51,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:51,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:51,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:51,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:51,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:51,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:51,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:51,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:51,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:51,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:51,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:51,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:51,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:51,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:51,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:51,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:51,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:51,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:51,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:51,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:51,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:51,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:51,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:51,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:51,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:51,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:51,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:51,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:51,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,409 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 03:26:51,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,412 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-07-29 03:26:51,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:51,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:51,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:51,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:51,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:51,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:51,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:51,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:51,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:51,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:51,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:51,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:51,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,546 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:51,574 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-29 03:26:51,574 INFO L444 ModelExtractionUtils]: 18 out of 31 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:51,577 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:51,579 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:51,579 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:51,579 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_3, ULTIMATE.start_cstrreplace_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_3 - 1*ULTIMATE.start_cstrreplace_~p~0.offset Supporting invariants [] [2020-07-29 03:26:51,624 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 03:26:51,629 INFO L393 LassoCheck]: Loop: "call cstrreplace_#t~mem2 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);" "assume !!(0 != cstrreplace_#t~mem2);havoc cstrreplace_#t~mem2;call cstrreplace_#t~mem3 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);" "assume cstrreplace_#t~mem3 == cstrreplace_~old;havoc cstrreplace_#t~mem3;call write~int(cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);cstrreplace_#t~post4 := cstrreplace_~numReplaced~0;cstrreplace_~numReplaced~0 := 1 + cstrreplace_#t~post4;havoc cstrreplace_#t~post4;" "cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset := cstrreplace_~p~0.base, cstrreplace_~p~0.offset;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_#t~post5.base, 1 + cstrreplace_#t~post5.offset;havoc cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset;" [2020-07-29 03:26:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:51,636 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:51,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:51,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:51,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:51,716 INFO L280 TraceCheckUtils]: 0: Hoare triple {428#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {428#unseeded} is VALID [2020-07-29 03:26:51,717 INFO L280 TraceCheckUtils]: 1: Hoare triple {428#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; {428#unseeded} is VALID [2020-07-29 03:26:51,717 INFO L280 TraceCheckUtils]: 2: Hoare triple {428#unseeded} assume !(main_~length1~0 < 1); {428#unseeded} is VALID [2020-07-29 03:26:51,718 INFO L280 TraceCheckUtils]: 3: Hoare triple {428#unseeded} call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; {475#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} is VALID [2020-07-29 03:26:51,719 INFO L280 TraceCheckUtils]: 4: Hoare triple {475#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet9, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet9; {475#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} is VALID [2020-07-29 03:26:51,719 INFO L280 TraceCheckUtils]: 5: Hoare triple {475#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; {475#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} is VALID [2020-07-29 03:26:51,721 INFO L280 TraceCheckUtils]: 6: Hoare triple {475#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet9, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet9; {475#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} is VALID [2020-07-29 03:26:51,721 INFO L280 TraceCheckUtils]: 7: Hoare triple {475#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; {475#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} is VALID [2020-07-29 03:26:51,722 INFO L280 TraceCheckUtils]: 8: Hoare triple {475#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} assume !(main_~i~0 < main_~length1~0 - 1); {475#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} is VALID [2020-07-29 03:26:51,725 INFO L280 TraceCheckUtils]: 9: Hoare triple {475#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrreplace_#in~s.base, cstrreplace_#in~s.offset, cstrreplace_#in~old, cstrreplace_#in~new := main_~nondetString1~0.base, main_~nondetString1~0.offset, (if main_#t~nondet10 % 256 <= 127 then main_#t~nondet10 % 256 else main_#t~nondet10 % 256 - 256), (if main_#t~nondet11 % 256 <= 127 then main_#t~nondet11 % 256 else main_#t~nondet11 % 256 - 256);havoc cstrreplace_#res;havoc cstrreplace_#t~mem3, cstrreplace_#t~post4, cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset, cstrreplace_#t~mem2, cstrreplace_~s.base, cstrreplace_~s.offset, cstrreplace_~old, cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, cstrreplace_~numReplaced~0;cstrreplace_~s.base, cstrreplace_~s.offset := cstrreplace_#in~s.base, cstrreplace_#in~s.offset;cstrreplace_~old := cstrreplace_#in~old;cstrreplace_~new := cstrreplace_#in~new;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_~s.base, cstrreplace_~s.offset;cstrreplace_~numReplaced~0 := 0; {457#(and (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|) unseeded)} is VALID [2020-07-29 03:26:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:51,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:26:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:51,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:51,767 INFO L280 TraceCheckUtils]: 0: Hoare triple {458#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) (* (- 1) ULTIMATE.start_cstrreplace_~p~0.offset))) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} call cstrreplace_#t~mem2 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); {494#(and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) (select |#length| ULTIMATE.start_cstrreplace_~p~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) (+ oldRank0 ULTIMATE.start_cstrreplace_~p~0.offset)) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} is VALID [2020-07-29 03:26:51,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {494#(and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) (select |#length| ULTIMATE.start_cstrreplace_~p~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) (+ oldRank0 ULTIMATE.start_cstrreplace_~p~0.offset)) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} assume !!(0 != cstrreplace_#t~mem2);havoc cstrreplace_#t~mem2;call cstrreplace_#t~mem3 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); {494#(and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) (select |#length| ULTIMATE.start_cstrreplace_~p~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) (+ oldRank0 ULTIMATE.start_cstrreplace_~p~0.offset)) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} is VALID [2020-07-29 03:26:51,770 INFO L280 TraceCheckUtils]: 2: Hoare triple {494#(and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) (select |#length| ULTIMATE.start_cstrreplace_~p~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) (+ oldRank0 ULTIMATE.start_cstrreplace_~p~0.offset)) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} assume cstrreplace_#t~mem3 == cstrreplace_~old;havoc cstrreplace_#t~mem3;call write~int(cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);cstrreplace_#t~post4 := cstrreplace_~numReplaced~0;cstrreplace_~numReplaced~0 := 1 + cstrreplace_#t~post4;havoc cstrreplace_#t~post4; {494#(and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) (select |#length| ULTIMATE.start_cstrreplace_~p~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) (+ oldRank0 ULTIMATE.start_cstrreplace_~p~0.offset)) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} is VALID [2020-07-29 03:26:51,772 INFO L280 TraceCheckUtils]: 3: Hoare triple {494#(and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) (select |#length| ULTIMATE.start_cstrreplace_~p~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) (+ oldRank0 ULTIMATE.start_cstrreplace_~p~0.offset)) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset := cstrreplace_~p~0.base, cstrreplace_~p~0.offset;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_#t~post5.base, 1 + cstrreplace_#t~post5.offset;havoc cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset; {460#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc7.base|) (* (- 1) ULTIMATE.start_cstrreplace_~p~0.offset)))) unseeded) (= ULTIMATE.start_cstrreplace_~p~0.base |ULTIMATE.start_main_#t~malloc7.base|))} is VALID [2020-07-29 03:26:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:51,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:51,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:51,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:51,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,792 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 03:26:51,792 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-07-29 03:26:51,878 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 18 states and 23 transitions. Complement of second has 5 states. [2020-07-29 03:26:51,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:51,878 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:51,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 03:26:51,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:51,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:51,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:26:51,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:51,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:51,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:51,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2020-07-29 03:26:51,881 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:51,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:51,881 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 03:26:51,883 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:26:51,883 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:26:51,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:51,884 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:51,884 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 23 transitions. cyclomatic complexity: 7 [2020-07-29 03:26:51,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. cyclomatic complexity: 7 [2020-07-29 03:26:51,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:51,885 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:26:51,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:51,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:51,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:51,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:51,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:51,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:51,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:26:51,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:26:51,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:26:51,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 14 letters. [2020-07-29 03:26:51,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 03:26:51,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2020-07-29 03:26:51,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:51,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:51,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:51,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:51,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:51,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:51,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:51,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:51,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:51,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:51,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:51,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:51,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:51,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:51,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:51,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:51,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:51,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 23 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:51,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,895 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:26:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 03:26:51,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:51,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:26:51,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 8 letters. [2020-07-29 03:26:51,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:51,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. cyclomatic complexity: 7 [2020-07-29 03:26:51,898 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:51,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2020-07-29 03:26:51,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:26:51,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:26:51,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:26:51,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:51,899 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:51,899 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:51,899 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:51,900 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:26:51,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:26:51,900 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:51,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:51,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:26:51 BoogieIcfgContainer [2020-07-29 03:26:51,907 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:26:51,908 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:26:51,908 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:26:51,908 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:26:51,909 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:39" (3/4) ... [2020-07-29 03:26:51,912 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:26:51,912 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:26:51,915 INFO L168 Benchmark]: Toolchain (without parser) took 14077.01 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 381.2 MB). Free memory was 961.6 MB in the beginning and 1.2 GB in the end (delta: -202.0 MB). Peak memory consumption was 179.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:51,915 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:51,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:51,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:51,917 INFO L168 Benchmark]: Boogie Preprocessor took 32.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:51,918 INFO L168 Benchmark]: RCFGBuilder took 502.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:51,920 INFO L168 Benchmark]: BuchiAutomizer took 12886.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 242.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.7 MB). Peak memory consumption was 166.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:51,921 INFO L168 Benchmark]: Witness Printer took 4.43 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:51,924 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 591.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 502.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12886.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 242.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.7 MB). Peak memory consumption was 166.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.43 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * p + 3 and consists of 7 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * p and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 11.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 37 SDtfs, 62 SDslu, 48 SDs, 0 SdLazy, 77 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital415 mio100 ax108 hnf98 lsp158 ukn50 mio100 lsp30 div124 bol100 ite100 ukn100 eq161 hnf78 smp94 dnf167 smp68 tf100 neg98 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 5 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...