./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/substring-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/substring-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 6e748b563bb7a11726b28f7957ce1a00b7c8807b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 08:19:03,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:19:03,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:19:03,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:19:03,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:19:03,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:19:03,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:19:03,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:19:03,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:19:03,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:19:03,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:19:03,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:19:03,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:19:03,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:19:03,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:19:03,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:19:03,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:19:03,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:19:03,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:19:03,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:19:03,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:19:03,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:19:03,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:19:03,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:19:03,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:19:03,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:19:03,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:19:03,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:19:03,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:19:03,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:19:03,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:19:03,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:19:03,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:19:03,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:19:03,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:19:03,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:19:03,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:19:03,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:19:03,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:19:03,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:19:03,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:19:03,558 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:19:03,582 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:19:03,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:19:03,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:19:03,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:19:03,584 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:19:03,585 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:19:03,585 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:19:03,585 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:19:03,586 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:19:03,586 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:19:03,586 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:19:03,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:19:03,587 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:19:03,587 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:19:03,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:19:03,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:19:03,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:19:03,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:19:03,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:19:03,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:19:03,589 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:19:03,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:19:03,589 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:19:03,589 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:19:03,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:19:03,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:19:03,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:19:03,590 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:19:03,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:19:03,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:19:03,591 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:19:03,591 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:19:03,592 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:19:03,593 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 -> 6e748b563bb7a11726b28f7957ce1a00b7c8807b [2020-10-20 08:19:03,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:19:03,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:19:03,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:19:03,882 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:19:03,883 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:19:03,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2020-10-20 08:19:03,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/079bb602c/f0c181af3e4b48eea2395b027c5ed4d3/FLAGa70c12c24 [2020-10-20 08:19:04,550 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:19:04,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2020-10-20 08:19:04,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/079bb602c/f0c181af3e4b48eea2395b027c5ed4d3/FLAGa70c12c24 [2020-10-20 08:19:04,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/079bb602c/f0c181af3e4b48eea2395b027c5ed4d3 [2020-10-20 08:19:04,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:19:04,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:19:04,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:19:04,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:19:04,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:19:04,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:19:04" (1/1) ... [2020-10-20 08:19:04,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317b71a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:04, skipping insertion in model container [2020-10-20 08:19:04,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:19:04" (1/1) ... [2020-10-20 08:19:04,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:19:04,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:19:05,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:19:05,411 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:19:05,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:19:05,513 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:19:05,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:05 WrapperNode [2020-10-20 08:19:05,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:19:05,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:19:05,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:19:05,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:19:05,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:05" (1/1) ... [2020-10-20 08:19:05,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:05" (1/1) ... [2020-10-20 08:19:05,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:19:05,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:19:05,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:19:05,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:19:05,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:05" (1/1) ... [2020-10-20 08:19:05,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:05" (1/1) ... [2020-10-20 08:19:05,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:05" (1/1) ... [2020-10-20 08:19:05,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:05" (1/1) ... [2020-10-20 08:19:05,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:05" (1/1) ... [2020-10-20 08:19:05,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:05" (1/1) ... [2020-10-20 08:19:05,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:05" (1/1) ... [2020-10-20 08:19:05,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:19:05,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:19:05,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:19:05,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:19:05,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 08:19:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 08:19:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:19:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:19:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:19:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:19:06,060 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:19:06,060 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-20 08:19:06,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:06 BoogieIcfgContainer [2020-10-20 08:19:06,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:19:06,064 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:19:06,064 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:19:06,068 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:19:06,069 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:06,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:19:04" (1/3) ... [2020-10-20 08:19:06,071 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@be84fb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:19:06, skipping insertion in model container [2020-10-20 08:19:06,072 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:06,072 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:05" (2/3) ... [2020-10-20 08:19:06,073 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@be84fb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:19:06, skipping insertion in model container [2020-10-20 08:19:06,073 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:06,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:06" (3/3) ... [2020-10-20 08:19:06,075 INFO L373 chiAutomizerObserver]: Analyzing ICFG substring-alloca-2.i [2020-10-20 08:19:06,153 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:19:06,154 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:19:06,155 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:19:06,155 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:19:06,155 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:19:06,155 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:19:06,155 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:19:06,156 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:19:06,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-10-20 08:19:06,190 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-20 08:19:06,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:06,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:06,197 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 08:19:06,198 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:19:06,198 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:19:06,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-10-20 08:19:06,200 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-20 08:19:06,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:06,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:06,201 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 08:19:06,201 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:19:06,207 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 15#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 16#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 11#L535-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 24#L541-3true [2020-10-20 08:19:06,208 INFO L796 eck$LassoCheckResult]: Loop: 24#L541-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 21#L541-2true main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 24#L541-3true [2020-10-20 08:19:06,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:06,215 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-10-20 08:19:06,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:06,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219962670] [2020-10-20 08:19:06,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:06,338 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:06,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:06,380 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:06,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:06,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-10-20 08:19:06,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:06,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904976104] [2020-10-20 08:19:06,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:06,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:06,402 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:06,405 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:06,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:06,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-10-20 08:19:06,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:06,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911164840] [2020-10-20 08:19:06,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:06,467 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:06,511 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:06,519 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:06,785 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-10-20 08:19:06,876 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:19:06,877 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:19:06,877 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:19:06,878 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:19:06,878 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:19:06,878 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:06,879 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:19:06,879 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:19:06,879 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration1_Lasso [2020-10-20 08:19:06,879 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:19:06,880 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:19:06,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:06,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:06,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:06,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:06,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:06,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:06,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:06,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:06,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:07,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:07,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:07,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:07,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:07,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:07,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:07,450 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:19:07,456 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:07,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:07,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:07,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:07,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:07,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:07,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:07,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:07,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:07,480 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-10-20 08:19:07,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:07,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:07,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:07,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:07,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:07,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:07,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:07,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:07,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:07,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:07,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:07,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:07,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:07,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:07,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:07,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:07,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:07,555 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-10-20 08:19:07,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:07,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:07,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:07,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:07,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:07,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:07,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:07,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:07,584 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-10-20 08:19:07,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:07,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:07,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:07,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:07,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:07,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:07,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:07,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:19:07,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:07,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:07,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:07,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:07,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:07,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:07,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:07,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:07,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:07,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:07,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:07,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:07,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:07,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:07,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:07,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:07,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:07,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:07,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:07,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:07,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:07,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:07,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:07,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:07,762 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) [2020-10-20 08:19:07,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:07,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:07,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:07,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:07,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:07,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:07,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:07,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:19:07,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:07,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:07,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:07,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:07,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:07,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:07,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:07,892 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) [2020-10-20 08:19:07,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:07,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:07,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:07,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:07,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:07,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:07,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:07,959 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:19:08,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:08,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:08,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:08,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:08,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:08,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:08,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:08,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:08,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:19:08,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:08,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:08,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:08,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:08,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:08,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:08,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:08,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:08,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-10-20 08:19:08,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:08,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:08,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:08,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:08,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:08,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:08,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:08,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:08,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:08,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:08,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:08,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:08,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:08,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:08,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:08,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:08,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:08,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:08,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:08,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:08,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:08,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:08,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:08,211 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:19:08,377 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-20 08:19:08,377 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:08,389 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:19:08,392 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:19:08,392 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:19:08,393 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-10-20 08:19:08,433 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-10-20 08:19:08,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:08,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:19:08,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:08,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:19:08,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:08,592 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 08:19:08,594 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states. Second operand 3 states. [2020-10-20 08:19:08,655 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states.. Second operand 3 states. Result 57 states and 84 transitions. Complement of second has 7 states. [2020-10-20 08:19:08,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:19:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:19:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2020-10-20 08:19:08,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-20 08:19:08,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:08,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 7 letters. Loop has 2 letters. [2020-10-20 08:19:08,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:08,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-20 08:19:08,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:08,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 84 transitions. [2020-10-20 08:19:08,667 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-20 08:19:08,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 19 states and 26 transitions. [2020-10-20 08:19:08,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 08:19:08,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:19:08,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2020-10-20 08:19:08,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:08,675 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-10-20 08:19:08,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2020-10-20 08:19:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-10-20 08:19:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-20 08:19:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2020-10-20 08:19:08,707 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-10-20 08:19:08,707 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-10-20 08:19:08,707 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:19:08,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2020-10-20 08:19:08,709 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-20 08:19:08,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:08,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:08,709 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:08,710 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:19:08,710 INFO L794 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 164#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 165#L532 assume !(main_~length1~0 < 1); 166#L532-2 assume !(main_~length2~0 < 1); 161#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 162#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 154#L541-4 main_~i~1 := 0; 155#L547-3 [2020-10-20 08:19:08,710 INFO L796 eck$LassoCheckResult]: Loop: 155#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 160#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 155#L547-3 [2020-10-20 08:19:08,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:08,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-10-20 08:19:08,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:08,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999123519] [2020-10-20 08:19:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:08,722 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:08,731 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:08,734 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:08,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:08,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-10-20 08:19:08,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:08,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994628239] [2020-10-20 08:19:08,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:08,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:08,746 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:08,748 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:08,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:08,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2020-10-20 08:19:08,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:08,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702882578] [2020-10-20 08:19:08,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:08,761 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:08,772 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:08,777 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:08,972 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-10-20 08:19:09,036 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:19:09,037 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:19:09,037 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:19:09,037 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:19:09,037 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:19:09,037 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:09,037 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:19:09,037 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:19:09,037 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration2_Lasso [2020-10-20 08:19:09,038 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:19:09,038 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:19:09,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:09,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:09,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:09,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:09,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:09,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:09,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:09,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:09,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:09,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:09,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:09,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:09,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:09,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:09,563 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:19:09,564 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:19:09,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:09,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:09,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:09,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:09,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:09,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:09,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:09,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:09,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:19:09,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:09,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:09,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:09,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:09,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:09,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:09,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:09,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:09,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:09,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:09,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:09,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:09,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:09,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:09,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:09,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:09,693 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) [2020-10-20 08:19:09,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:09,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:09,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:09,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:09,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:09,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:09,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:09,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:09,732 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) [2020-10-20 08:19:09,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:09,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:09,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:09,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:09,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:09,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:09,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:09,777 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) [2020-10-20 08:19:09,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:09,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:09,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:09,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:09,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:09,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:09,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:09,824 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-10-20 08:19:09,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:09,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:09,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:09,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:09,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:09,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:09,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:09,865 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) [2020-10-20 08:19:09,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:09,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:09,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:09,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:09,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:09,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:09,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:09,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:09,905 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-10-20 08:19:09,931 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:09,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:09,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:09,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:09,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:09,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:09,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:09,939 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-10-20 08:19:09,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:09,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:09,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:09,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:09,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:09,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:09,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:09,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:09,974 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-10-20 08:19:09,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:10,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:10,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:10,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:10,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:10,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:10,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:10,036 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:19:10,050 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-20 08:19:10,050 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. 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-10-20 08:19:10,052 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:19:10,058 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:19:10,058 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:19:10,058 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2020-10-20 08:19:10,091 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-10-20 08:19:10,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:10,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:19:10,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:10,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:19:10,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:10,142 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 08:19:10,142 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-20 08:19:10,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 42 transitions. Complement of second has 6 states. [2020-10-20 08:19:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:19:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:19:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-10-20 08:19:10,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2020-10-20 08:19:10,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:10,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 9 letters. Loop has 2 letters. [2020-10-20 08:19:10,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:10,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 4 letters. [2020-10-20 08:19:10,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:10,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 42 transitions. [2020-10-20 08:19:10,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 08:19:10,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 20 states and 28 transitions. [2020-10-20 08:19:10,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 08:19:10,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-20 08:19:10,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2020-10-20 08:19:10,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:10,170 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-10-20 08:19:10,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2020-10-20 08:19:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-20 08:19:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 08:19:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2020-10-20 08:19:10,173 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-10-20 08:19:10,173 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-10-20 08:19:10,173 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:19:10,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2020-10-20 08:19:10,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 08:19:10,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:10,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:10,175 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:10,175 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:10,175 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 287#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 288#L532 assume !(main_~length1~0 < 1); 289#L532-2 assume !(main_~length2~0 < 1); 284#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 285#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 276#L541-4 main_~i~1 := 0; 277#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 286#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 279#L517-3 [2020-10-20 08:19:10,176 INFO L796 eck$LassoCheckResult]: Loop: 279#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 274#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 275#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 278#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 291#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6; 280#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 281#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 279#L517-3 [2020-10-20 08:19:10,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:10,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2020-10-20 08:19:10,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:10,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856033750] [2020-10-20 08:19:10,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:10,192 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:10,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:10,213 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:10,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:10,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 1 times [2020-10-20 08:19:10,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:10,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646436249] [2020-10-20 08:19:10,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:10,229 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:10,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:10,240 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:10,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:10,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1515359350, now seen corresponding path program 1 times [2020-10-20 08:19:10,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:10,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343113197] [2020-10-20 08:19:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:10,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343113197] [2020-10-20 08:19:10,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:10,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 08:19:10,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717946820] [2020-10-20 08:19:10,683 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2020-10-20 08:19:10,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:10,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 08:19:10,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-20 08:19:10,731 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 7 states. [2020-10-20 08:19:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:10,856 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2020-10-20 08:19:10,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:19:10,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2020-10-20 08:19:10,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 08:19:10,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 28 transitions. [2020-10-20 08:19:10,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 08:19:10,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-20 08:19:10,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2020-10-20 08:19:10,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:10,860 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-10-20 08:19:10,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2020-10-20 08:19:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-10-20 08:19:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 08:19:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2020-10-20 08:19:10,864 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-10-20 08:19:10,865 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-10-20 08:19:10,865 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:19:10,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2020-10-20 08:19:10,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 08:19:10,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:10,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:10,868 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:10,868 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:10,869 INFO L794 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 351#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 352#L532 assume !(main_~length1~0 < 1); 353#L532-2 assume !(main_~length2~0 < 1); 348#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 349#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 356#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 357#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 340#L541-4 main_~i~1 := 0; 341#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 350#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 343#L517-3 [2020-10-20 08:19:10,869 INFO L796 eck$LassoCheckResult]: Loop: 343#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 338#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 339#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 342#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 355#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6; 344#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 345#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 343#L517-3 [2020-10-20 08:19:10,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:10,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2020-10-20 08:19:10,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:10,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889440720] [2020-10-20 08:19:10,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:10,908 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:10,930 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:10,935 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:10,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:10,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 2 times [2020-10-20 08:19:10,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:10,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138123443] [2020-10-20 08:19:10,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:10,944 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:10,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:10,953 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:10,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:10,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2020169960, now seen corresponding path program 1 times [2020-10-20 08:19:10,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:10,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414935824] [2020-10-20 08:19:10,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:19:11,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414935824] [2020-10-20 08:19:11,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:11,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 08:19:11,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890177268] [2020-10-20 08:19:11,272 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2020-10-20 08:19:11,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:11,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 08:19:11,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-20 08:19:11,319 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 9 states. [2020-10-20 08:19:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:11,550 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-10-20 08:19:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 08:19:11,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2020-10-20 08:19:11,551 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-10-20 08:19:11,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 42 transitions. [2020-10-20 08:19:11,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-10-20 08:19:11,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-10-20 08:19:11,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2020-10-20 08:19:11,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:11,554 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-10-20 08:19:11,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2020-10-20 08:19:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-10-20 08:19:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 08:19:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2020-10-20 08:19:11,566 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-10-20 08:19:11,566 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-10-20 08:19:11,566 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:19:11,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2020-10-20 08:19:11,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-10-20 08:19:11,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:11,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:11,572 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:11,572 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:11,572 INFO L794 eck$LassoCheckResult]: Stem: 433#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 430#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 431#L532 assume !(main_~length1~0 < 1); 432#L532-2 assume !(main_~length2~0 < 1); 426#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 427#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 436#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 437#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 416#L541-4 main_~i~1 := 0; 417#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 428#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 419#L517-3 [2020-10-20 08:19:11,573 INFO L796 eck$LassoCheckResult]: Loop: 419#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 420#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 440#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 434#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 435#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 438#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 444#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 443#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6; 442#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 441#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 419#L517-3 [2020-10-20 08:19:11,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2020-10-20 08:19:11,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:11,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163835704] [2020-10-20 08:19:11,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:11,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:11,615 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:11,620 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:11,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1312710103, now seen corresponding path program 1 times [2020-10-20 08:19:11,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:11,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641504818] [2020-10-20 08:19:11,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:11,632 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:11,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:11,644 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:11,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:11,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1844492576, now seen corresponding path program 1 times [2020-10-20 08:19:11,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:11,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359884437] [2020-10-20 08:19:11,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:19:11,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359884437] [2020-10-20 08:19:11,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787829289] [2020-10-20 08:19:11,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:19:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:11,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 08:19:11,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:11,958 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:11,959 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-10-20 08:19:11,959 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:19:12,003 INFO L625 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2020-10-20 08:19:12,009 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:19:12,009 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:5 [2020-10-20 08:19:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:19:12,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 08:19:12,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2020-10-20 08:19:12,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90616999] [2020-10-20 08:19:12,482 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 83 [2020-10-20 08:19:12,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:12,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 08:19:12,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-20 08:19:12,544 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. cyclomatic complexity: 14 Second operand 9 states. [2020-10-20 08:19:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:12,755 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-10-20 08:19:12,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 08:19:12,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2020-10-20 08:19:12,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 08:19:12,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 27 transitions. [2020-10-20 08:19:12,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 08:19:12,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-20 08:19:12,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2020-10-20 08:19:12,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:12,759 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-10-20 08:19:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2020-10-20 08:19:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-10-20 08:19:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 08:19:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-10-20 08:19:12,761 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-20 08:19:12,761 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-20 08:19:12,761 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:19:12,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-10-20 08:19:12,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 08:19:12,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:12,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:12,763 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:12,763 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:12,763 INFO L794 eck$LassoCheckResult]: Stem: 579#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 576#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 577#L532 assume !(main_~length1~0 < 1); 578#L532-2 assume !(main_~length2~0 < 1); 573#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 574#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 581#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 582#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 565#L541-4 main_~i~1 := 0; 566#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 571#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 572#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 575#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 568#L517-3 [2020-10-20 08:19:12,763 INFO L796 eck$LassoCheckResult]: Loop: 568#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 563#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 564#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 567#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 580#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6; 569#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 570#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 568#L517-3 [2020-10-20 08:19:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:12,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2020-10-20 08:19:12,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:12,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865079325] [2020-10-20 08:19:12,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:12,788 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:12,799 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:12,804 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:12,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:12,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 3 times [2020-10-20 08:19:12,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:12,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008181466] [2020-10-20 08:19:12,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:12,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:12,815 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:12,818 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:12,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:12,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1498710394, now seen corresponding path program 1 times [2020-10-20 08:19:12,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:12,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208442943] [2020-10-20 08:19:12,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:12,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:12,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:12,856 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:13,024 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2020-10-20 08:19:13,743 WARN L193 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2020-10-20 08:19:13,993 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-20 08:19:13,996 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:19:13,996 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:19:13,997 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:19:13,997 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:19:13,997 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:19:13,997 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:13,997 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:19:13,997 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:19:13,998 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration6_Lasso [2020-10-20 08:19:13,998 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:19:13,998 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:19:14,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,665 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2020-10-20 08:19:14,864 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2020-10-20 08:19:14,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:14,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-10-20 08:19:14,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-10-20 08:19:15,229 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-10-20 08:19:15,601 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-10-20 08:19:15,857 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2020-10-20 08:19:15,903 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:19:15,904 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:19:15,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:15,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:15,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:15,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:15,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:15,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:15,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:15,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:15,923 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) [2020-10-20 08:19:15,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:15,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:15,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:15,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:15,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:15,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:15,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:15,971 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) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:15,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:15,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:15,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:15,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:15,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:15,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:15,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:15,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:15,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:16,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:16,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:16,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:16,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:16,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:16,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:16,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:16,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:16,026 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) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:16,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:16,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:16,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:16,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:16,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:16,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:16,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:16,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:16,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:19:16,077 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:16,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:16,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:16,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:16,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:16,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:16,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:16,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:16,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:16,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:16,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:16,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:16,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:16,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:16,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:16,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:16,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:16,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:16,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:16,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:16,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:16,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:16,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:16,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:16,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:16,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:16,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:16,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:16,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:16,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:16,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:16,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:16,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:16,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:16,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:16,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:16,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:16,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:16,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:16,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:16,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:16,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:16,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:16,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:16,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:16,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:16,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:16,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:16,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:16,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:16,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:16,254 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:19:16,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-10-20 08:19:16,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:16,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:16,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:16,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:16,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:16,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:16,300 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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:16,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:16,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:16,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:16,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:16,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:16,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:16,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:16,373 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:19:16,423 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-10-20 08:19:16,423 INFO L444 ModelExtractionUtils]: 45 out of 64 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:16,428 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:19:16,431 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:19:16,431 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:19:16,431 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~ps~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3) = -1*ULTIMATE.start_substring_~ps~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 Supporting invariants [] [2020-10-20 08:19:16,525 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2020-10-20 08:19:16,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:19:16,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:16,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 08:19:16,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:16,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 08:19:16,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:16,626 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-10-20 08:19:16,626 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-20 08:19:16,682 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 27 states and 36 transitions. Complement of second has 5 states. [2020-10-20 08:19:16,683 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-10-20 08:19:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 08:19:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-10-20 08:19:16,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 7 letters. [2020-10-20 08:19:16,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:16,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 20 letters. Loop has 7 letters. [2020-10-20 08:19:16,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:16,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 14 letters. [2020-10-20 08:19:16,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:16,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2020-10-20 08:19:16,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:16,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2020-10-20 08:19:16,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 08:19:16,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 08:19:16,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-10-20 08:19:16,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:19:16,688 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-10-20 08:19:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-10-20 08:19:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-20 08:19:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-20 08:19:16,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2020-10-20 08:19:16,690 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-10-20 08:19:16,690 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-10-20 08:19:16,690 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:19:16,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2020-10-20 08:19:16,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:16,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:16,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:16,692 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:16,692 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:19:16,692 INFO L794 eck$LassoCheckResult]: Stem: 786#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 783#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 784#L532 assume !(main_~length1~0 < 1); 785#L532-2 assume !(main_~length2~0 < 1); 780#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 781#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 789#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 790#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 770#L541-4 main_~i~1 := 0; 771#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 778#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 779#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 782#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 774#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 766#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 767#L520-5 [2020-10-20 08:19:16,692 INFO L796 eck$LassoCheckResult]: Loop: 767#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 772#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 787#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 767#L520-5 [2020-10-20 08:19:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034719, now seen corresponding path program 1 times [2020-10-20 08:19:16,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:16,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305644513] [2020-10-20 08:19:16,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:16,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:16,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:16,720 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:16,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:16,720 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 1 times [2020-10-20 08:19:16,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:16,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206501223] [2020-10-20 08:19:16,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:16,725 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:16,740 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:16,742 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:16,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1075534243, now seen corresponding path program 1 times [2020-10-20 08:19:16,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:16,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206990246] [2020-10-20 08:19:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:16,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:16,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:16,773 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:16,879 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-10-20 08:19:17,830 WARN L193 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 130 [2020-10-20 08:19:18,125 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-20 08:19:18,127 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:19:18,127 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:19:18,127 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:19:18,127 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:19:18,127 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:19:18,128 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:18,128 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:19:18,128 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:19:18,128 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration7_Lasso [2020-10-20 08:19:18,128 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:19:18,128 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:19:18,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:18,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:18,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:18,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:18,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:18,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:18,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:18,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:18,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,041 WARN L193 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 101 [2020-10-20 08:19:19,310 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2020-10-20 08:19:19,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:19,744 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2020-10-20 08:19:20,252 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-20 08:19:20,489 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:19:20,489 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:20,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:20,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:20,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:20,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:20,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:20,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:20,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:20,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:20,497 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:20,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:20,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:20,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:20,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:20,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:20,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:20,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:20,528 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:19:20,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:20,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:20,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:20,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:20,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:20,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:20,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:20,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:20,556 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 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:20,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:20,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:20,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:20,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:20,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:20,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:20,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:20,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:20,582 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 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:20,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:20,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:20,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:20,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:20,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:20,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:20,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:20,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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:20,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:20,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:20,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:20,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:20,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:20,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:20,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:20,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:20,639 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 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:20,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:20,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:20,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:20,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:20,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:20,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:20,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:20,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:20,669 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 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:20,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:20,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:20,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:20,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:20,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:20,696 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:20,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:20,701 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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:20,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:20,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:20,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:20,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:20,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:20,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:20,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:20,731 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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:20,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:20,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:20,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:20,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:20,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:20,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:20,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:20,763 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:20,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:20,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:20,786 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-20 08:19:20,786 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:19:20,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:20,799 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-10-20 08:19:20,799 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-20 08:19:20,830 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 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:20,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:20,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:20,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:20,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:20,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:20,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:20,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:20,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:20,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:20,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:20,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:20,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:20,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:20,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:20,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:20,900 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:20,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:20,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:20,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:20,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:20,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:20,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:20,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:20,982 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:19:21,055 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2020-10-20 08:19:21,056 INFO L444 ModelExtractionUtils]: 24 out of 64 variables were initially zero. Simplification set additionally 37 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:21,059 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:19:21,061 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:19:21,062 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:19:21,062 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_4, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_4 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2020-10-20 08:19:21,238 INFO L297 tatePredicateManager]: 31 out of 32 supporting invariants were superfluous and have been removed [2020-10-20 08:19:21,240 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:19:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:21,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 08:19:21,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:21,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 08:19:21,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:21,354 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-10-20 08:19:21,355 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-10-20 08:19:21,456 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 48 states and 64 transitions. Complement of second has 7 states. [2020-10-20 08:19:21,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 08:19:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:19:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-10-20 08:19:21,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-20 08:19:21,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:21,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 18 letters. Loop has 3 letters. [2020-10-20 08:19:21,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:21,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 15 letters. Loop has 6 letters. [2020-10-20 08:19:21,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:21,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2020-10-20 08:19:21,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:21,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 36 states and 48 transitions. [2020-10-20 08:19:21,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 08:19:21,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 08:19:21,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 48 transitions. [2020-10-20 08:19:21,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:19:21,464 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2020-10-20 08:19:21,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 48 transitions. [2020-10-20 08:19:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2020-10-20 08:19:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 08:19:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-20 08:19:21,471 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-20 08:19:21,471 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-20 08:19:21,471 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:19:21,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2020-10-20 08:19:21,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:21,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:21,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:21,474 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:21,475 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:19:21,475 INFO L794 eck$LassoCheckResult]: Stem: 1075#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1072#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 1073#L532 assume !(main_~length1~0 < 1); 1074#L532-2 assume !(main_~length2~0 < 1); 1069#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 1070#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1079#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1080#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1058#L541-4 main_~i~1 := 0; 1059#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1067#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1068#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1071#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 1064#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1065#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1082#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1077#L520-1 assume !substring_#t~short6; 1078#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6; 1062#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1063#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 1066#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1054#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1055#L520-5 [2020-10-20 08:19:21,475 INFO L796 eck$LassoCheckResult]: Loop: 1055#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1060#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1076#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 1055#L520-5 [2020-10-20 08:19:21,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:21,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1389384631, now seen corresponding path program 1 times [2020-10-20 08:19:21,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:21,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765811357] [2020-10-20 08:19:21,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 08:19:21,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765811357] [2020-10-20 08:19:21,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:21,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:19:21,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832086865] [2020-10-20 08:19:21,511 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:19:21,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:21,511 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 2 times [2020-10-20 08:19:21,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:21,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187035905] [2020-10-20 08:19:21,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:21,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:21,518 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:21,520 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:21,647 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-10-20 08:19:21,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:21,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:19:21,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:19:21,678 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-10-20 08:19:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:21,730 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2020-10-20 08:19:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:19:21,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2020-10-20 08:19:21,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 08:19:21,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 34 states and 44 transitions. [2020-10-20 08:19:21,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 08:19:21,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 08:19:21,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2020-10-20 08:19:21,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:19:21,734 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-20 08:19:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2020-10-20 08:19:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-10-20 08:19:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-20 08:19:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2020-10-20 08:19:21,737 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-10-20 08:19:21,737 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-10-20 08:19:21,737 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:19:21,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2020-10-20 08:19:21,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:21,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:21,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:21,739 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:21,739 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:19:21,739 INFO L794 eck$LassoCheckResult]: Stem: 1153#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1150#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 1151#L532 assume !(main_~length1~0 < 1); 1152#L532-2 assume !(main_~length2~0 < 1); 1147#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 1148#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1157#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1158#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1136#L541-4 main_~i~1 := 0; 1137#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1145#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1146#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1149#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 1140#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1141#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1162#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1161#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1160#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6; 1143#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1144#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 1142#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1132#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1133#L520-5 [2020-10-20 08:19:21,739 INFO L796 eck$LassoCheckResult]: Loop: 1133#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1138#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1154#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 1133#L520-5 [2020-10-20 08:19:21,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:21,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1446642933, now seen corresponding path program 2 times [2020-10-20 08:19:21,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:21,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370394478] [2020-10-20 08:19:21,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:19:21,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370394478] [2020-10-20 08:19:21,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768210307] [2020-10-20 08:19:21,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:19:22,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:19:22,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:19:22,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-20 08:19:22,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:22,093 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-20 08:19:22,094 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:19:22,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:22,098 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:19:22,099 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2020-10-20 08:19:22,220 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2020-10-20 08:19:22,220 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:19:22,230 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:22,236 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-20 08:19:22,237 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:31 [2020-10-20 08:19:22,427 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:22,428 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2020-10-20 08:19:22,429 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-20 08:19:22,445 INFO L625 ElimStorePlain]: treesize reduction 8, result has 63.6 percent of original size [2020-10-20 08:19:22,448 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:19:22,448 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2020-10-20 08:19:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:19:22,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:19:22,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-10-20 08:19:22,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8136473] [2020-10-20 08:19:22,453 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:19:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:22,453 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 3 times [2020-10-20 08:19:22,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:22,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327684341] [2020-10-20 08:19:22,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:22,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:22,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:22,462 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:22,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:22,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 08:19:22,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-10-20 08:19:22,595 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 15 Second operand 15 states. [2020-10-20 08:19:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:23,103 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2020-10-20 08:19:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 08:19:23,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 65 transitions. [2020-10-20 08:19:23,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:23,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 35 states and 45 transitions. [2020-10-20 08:19:23,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 08:19:23,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 08:19:23,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2020-10-20 08:19:23,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:19:23,106 INFO L691 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-20 08:19:23,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2020-10-20 08:19:23,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-10-20 08:19:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-20 08:19:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2020-10-20 08:19:23,109 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-20 08:19:23,109 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-10-20 08:19:23,109 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:19:23,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2020-10-20 08:19:23,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:23,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:23,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:23,110 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:23,110 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:19:23,111 INFO L794 eck$LassoCheckResult]: Stem: 1331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1328#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 1329#L532 assume !(main_~length1~0 < 1); 1330#L532-2 assume !(main_~length2~0 < 1); 1325#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 1326#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1334#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1335#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1336#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1337#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1313#L541-4 main_~i~1 := 0; 1314#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1323#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1324#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1327#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 1320#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1311#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1312#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1317#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1338#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6; 1318#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1319#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 1321#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1309#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1310#L520-5 [2020-10-20 08:19:23,111 INFO L796 eck$LassoCheckResult]: Loop: 1310#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1315#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1332#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 1310#L520-5 [2020-10-20 08:19:23,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:23,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1546919447, now seen corresponding path program 3 times [2020-10-20 08:19:23,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:23,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855878691] [2020-10-20 08:19:23,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:23,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:23,148 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:23,153 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:23,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:23,154 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 4 times [2020-10-20 08:19:23,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:23,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381994306] [2020-10-20 08:19:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:23,158 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:23,160 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:23,162 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:23,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:23,165 INFO L82 PathProgramCache]: Analyzing trace with hash 721898201, now seen corresponding path program 1 times [2020-10-20 08:19:23,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:23,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295802872] [2020-10-20 08:19:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:23,190 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:23,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:23,233 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:23,348 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-10-20 08:19:25,116 WARN L193 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 236 DAG size of output: 180 [2020-10-20 08:19:25,477 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-20 08:19:25,481 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:19:25,481 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:19:25,481 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:19:25,481 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:19:25,481 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:19:25,482 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:25,482 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:19:25,482 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:19:25,482 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration10_Lasso [2020-10-20 08:19:25,482 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:19:25,482 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:19:25,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:25,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:25,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:25,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:25,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:25,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:25,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,406 WARN L193 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 112 [2020-10-20 08:19:26,680 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-10-20 08:19:26,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:26,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:27,176 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2020-10-20 08:19:27,686 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-20 08:19:28,404 WARN L193 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2020-10-20 08:19:28,470 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:19:28,471 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:28,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:28,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:28,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:28,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:28,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:28,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:28,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:28,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:28,478 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 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:28,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:28,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:28,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:28,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:28,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:28,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:28,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:28,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:28,503 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 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:28,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:28,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:28,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:28,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:28,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:28,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:28,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:28,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:28,531 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 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:28,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:28,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:28,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:28,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:28,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:28,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:28,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:28,560 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 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:28,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:28,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:28,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:28,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:28,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:28,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:28,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:28,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:28,584 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 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:28,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:28,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:28,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:28,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:28,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:28,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:28,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:28,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:28,609 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 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:28,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:28,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:28,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:28,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:28,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:28,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:28,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:28,646 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 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:28,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:28,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:28,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:28,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:28,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:28,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:28,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:28,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:28,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:28,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:28,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:28,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:28,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:28,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:28,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:28,708 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 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:28,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:28,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:28,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:28,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:28,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:28,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:28,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:28,759 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 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:28,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:28,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:28,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:28,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:28,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:28,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:28,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:28,794 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 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:28,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:28,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:28,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:28,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:28,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:28,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:28,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:28,837 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 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:28,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:28,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:28,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:28,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:28,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:28,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:28,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:28,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:19:29,038 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-10-20 08:19:29,038 INFO L444 ModelExtractionUtils]: 10 out of 58 variables were initially zero. Simplification set additionally 45 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:19:29,045 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:29,049 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:19:29,049 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:19:29,049 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_5, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_5 - 1*ULTIMATE.start_substring_~ps2~0.offset Supporting invariants [] [2020-10-20 08:19:29,431 INFO L297 tatePredicateManager]: 38 out of 40 supporting invariants were superfluous and have been removed [2020-10-20 08:19:29,439 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:19:29,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:29,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 08:19:29,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:29,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 08:19:29,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:29,598 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-10-20 08:19:29,598 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand 6 states. [2020-10-20 08:19:29,740 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 52 states and 66 transitions. Complement of second has 9 states. [2020-10-20 08:19:29,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:19:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 08:19:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-10-20 08:19:29,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 24 letters. Loop has 3 letters. [2020-10-20 08:19:29,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:29,744 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 08:19:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:29,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 08:19:29,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:29,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 08:19:29,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:29,872 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2020-10-20 08:19:29,872 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand 6 states. [2020-10-20 08:19:29,960 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 52 states and 66 transitions. Complement of second has 9 states. [2020-10-20 08:19:29,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:19:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 08:19:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-10-20 08:19:29,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 24 letters. Loop has 3 letters. [2020-10-20 08:19:29,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:29,968 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 08:19:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:30,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 08:19:30,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:30,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 08:19:30,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:30,109 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-10-20 08:19:30,110 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand 6 states. [2020-10-20 08:19:30,220 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 60 states and 78 transitions. Complement of second has 8 states. [2020-10-20 08:19:30,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:19:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 08:19:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-10-20 08:19:30,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 24 letters. Loop has 3 letters. [2020-10-20 08:19:30,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:30,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 27 letters. Loop has 3 letters. [2020-10-20 08:19:30,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:30,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 24 letters. Loop has 6 letters. [2020-10-20 08:19:30,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:30,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 78 transitions. [2020-10-20 08:19:30,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:30,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 51 states and 66 transitions. [2020-10-20 08:19:30,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 08:19:30,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-20 08:19:30,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2020-10-20 08:19:30,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:19:30,231 INFO L691 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2020-10-20 08:19:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2020-10-20 08:19:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2020-10-20 08:19:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-20 08:19:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2020-10-20 08:19:30,242 INFO L714 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2020-10-20 08:19:30,243 INFO L594 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2020-10-20 08:19:30,243 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 08:19:30,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 64 transitions. [2020-10-20 08:19:30,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:19:30,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:30,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:30,245 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:30,246 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:19:30,246 INFO L794 eck$LassoCheckResult]: Stem: 2004#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2001#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 2002#L532 assume !(main_~length1~0 < 1); 2003#L532-2 assume !(main_~length2~0 < 1); 1998#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 1999#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 2008#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 2009#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 2011#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 2013#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1985#L541-4 main_~i~1 := 0; 1986#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1996#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1997#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 2000#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 1991#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1992#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 2027#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 2014#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 2012#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6; 1994#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1995#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 1993#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1981#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1982#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1988#L520-1 [2020-10-20 08:19:30,246 INFO L796 eck$LassoCheckResult]: Loop: 1988#L520-1 assume !substring_#t~short6; 2005#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 1987#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1988#L520-1 [2020-10-20 08:19:30,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:30,247 INFO L82 PathProgramCache]: Analyzing trace with hash -709862543, now seen corresponding path program 4 times [2020-10-20 08:19:30,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:30,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991644372] [2020-10-20 08:19:30,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:30,275 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:30,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:30,303 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:30,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:30,304 INFO L82 PathProgramCache]: Analyzing trace with hash 92531, now seen corresponding path program 1 times [2020-10-20 08:19:30,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:30,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341588577] [2020-10-20 08:19:30,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:30,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341588577] [2020-10-20 08:19:30,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:30,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:19:30,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689730462] [2020-10-20 08:19:30,314 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:19:30,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:30,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:19:30,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:19:30,315 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. cyclomatic complexity: 22 Second operand 3 states. [2020-10-20 08:19:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:30,326 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2020-10-20 08:19:30,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:19:30,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2020-10-20 08:19:30,328 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:19:30,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 0 states and 0 transitions. [2020-10-20 08:19:30,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 08:19:30,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 08:19:30,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 08:19:30,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:30,328 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:19:30,328 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:19:30,329 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:19:30,329 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 08:19:30,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 08:19:30,329 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:19:30,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 08:19:30,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:19:30 BoogieIcfgContainer [2020-10-20 08:19:30,336 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:19:30,338 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:19:30,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:19:30,338 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:19:30,339 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:06" (3/4) ... [2020-10-20 08:19:30,342 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 08:19:30,343 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:19:30,344 INFO L168 Benchmark]: Toolchain (without parser) took 25486.88 ms. Allocated memory was 40.9 MB in the beginning and 137.9 MB in the end (delta: 97.0 MB). Free memory was 17.9 MB in the beginning and 29.0 MB in the end (delta: -11.1 MB). Peak memory consumption was 85.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:30,345 INFO L168 Benchmark]: CDTParser took 1.95 ms. Allocated memory is still 31.5 MB. Free memory was 7.4 MB in the beginning and 7.4 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. [2020-10-20 08:19:30,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 652.81 ms. Allocated memory was 40.9 MB in the beginning and 43.0 MB in the end (delta: 2.1 MB). Free memory was 17.0 MB in the beginning and 20.6 MB in the end (delta: -3.7 MB). Peak memory consumption was 7.4 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:30,346 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.93 ms. Allocated memory is still 43.0 MB. Free memory was 20.6 MB in the beginning and 18.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:30,346 INFO L168 Benchmark]: Boogie Preprocessor took 34.80 ms. Allocated memory is still 43.0 MB. Free memory was 18.5 MB in the beginning and 16.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:30,346 INFO L168 Benchmark]: RCFGBuilder took 438.21 ms. Allocated memory was 43.0 MB in the beginning and 43.5 MB in the end (delta: 524.3 kB). Free memory was 16.9 MB in the beginning and 13.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 6.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:30,347 INFO L168 Benchmark]: BuchiAutomizer took 24272.80 ms. Allocated memory was 43.5 MB in the beginning and 137.9 MB in the end (delta: 94.4 MB). Free memory was 13.5 MB in the beginning and 29.0 MB in the end (delta: -15.5 MB). Peak memory consumption was 78.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:30,347 INFO L168 Benchmark]: Witness Printer took 5.13 ms. Allocated memory is still 137.9 MB. Free memory was 29.0 MB in the beginning and 29.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 14.3 GB. [2020-10-20 08:19:30,351 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.95 ms. Allocated memory is still 31.5 MB. Free memory was 7.4 MB in the beginning and 7.4 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 652.81 ms. Allocated memory was 40.9 MB in the beginning and 43.0 MB in the end (delta: 2.1 MB). Free memory was 17.0 MB in the beginning and 20.6 MB in the end (delta: -3.7 MB). Peak memory consumption was 7.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 72.93 ms. Allocated memory is still 43.0 MB. Free memory was 20.6 MB in the beginning and 18.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 34.80 ms. Allocated memory is still 43.0 MB. Free memory was 18.5 MB in the beginning and 16.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 438.21 ms. Allocated memory was 43.0 MB in the beginning and 43.5 MB in the end (delta: 524.3 kB). Free memory was 16.9 MB in the beginning and 13.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 6.8 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 24272.80 ms. Allocated memory was 43.5 MB in the beginning and 137.9 MB in the end (delta: 94.4 MB). Free memory was 13.5 MB in the beginning and 29.0 MB in the end (delta: -15.5 MB). Peak memory consumption was 78.9 MB. Max. memory is 14.3 GB. * Witness Printer took 5.13 ms. Allocated memory is still 137.9 MB. Free memory was 29.0 MB in the beginning and 29.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function -1 * ps + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * pt and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * ps2 and consists of 6 locations. 6 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.2s and 12 iterations. TraceHistogramMax:2. Analysis of lassos took 21.3s. Construction of modules took 0.6s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 13 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 10. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 235 SDtfs, 420 SDslu, 496 SDs, 0 SdLazy, 459 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital294 mio100 ax108 hnf98 lsp88 ukn69 mio100 lsp50 div100 bol100 ite100 ukn100 eq184 hnf90 smp97 dnf131 smp93 tf100 neg98 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 47ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...