./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.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 b812e7d14425eea3a24125f5e2db40eadfc6c14c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:26:21,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:26:21,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:26:21,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:26:21,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:26:21,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:26:21,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:26:21,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:26:21,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:26:21,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:26:21,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:26:21,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:26:21,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:26:21,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:26:21,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:26:21,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:26:21,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:26:21,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:26:21,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:26:21,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:26:21,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:26:21,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:26:21,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:26:21,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:26:21,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:26:21,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:26:21,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:26:21,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:26:21,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:26:21,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:26:21,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:26:21,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:26:21,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:26:21,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:26:21,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:26:21,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:26:21,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:26:21,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:26:21,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:26:21,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:26:21,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:26:21,142 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:26:21,161 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:26:21,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:26:21,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:26:21,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:26:21,163 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:26:21,164 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:26:21,164 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:26:21,164 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:26:21,164 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:26:21,165 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:26:21,165 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:26:21,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:26:21,166 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:26:21,166 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:26:21,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:26:21,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:26:21,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:26:21,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:26:21,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:26:21,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:26:21,168 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:26:21,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:26:21,169 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:26:21,169 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:26:21,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:26:21,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:26:21,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:26:21,170 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:26:21,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:26:21,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:26:21,171 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:26:21,171 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:26:21,172 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:26:21,173 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 -> b812e7d14425eea3a24125f5e2db40eadfc6c14c [2020-07-29 03:26:21,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:26:21,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:26:21,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:26:21,505 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:26:21,505 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:26:21,507 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i [2020-07-29 03:26:21,590 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c68f73417/b53eadf221074e918afc49e0997eefff/FLAGf7686ce5a [2020-07-29 03:26:22,212 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:26:22,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i [2020-07-29 03:26:22,227 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c68f73417/b53eadf221074e918afc49e0997eefff/FLAGf7686ce5a [2020-07-29 03:26:22,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c68f73417/b53eadf221074e918afc49e0997eefff [2020-07-29 03:26:22,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:26:22,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:26:22,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:22,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:26:22,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:26:22,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:22" (1/1) ... [2020-07-29 03:26:22,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a37da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:22, skipping insertion in model container [2020-07-29 03:26:22,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:22" (1/1) ... [2020-07-29 03:26:22,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:26:22,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:26:22,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:22,941 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:26:23,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:23,085 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:26:23,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:23 WrapperNode [2020-07-29 03:26:23,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:23,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:23,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:26:23,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:26:23,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:23" (1/1) ... [2020-07-29 03:26:23,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:23" (1/1) ... [2020-07-29 03:26:23,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:23,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:26:23,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:26:23,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:26:23,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:23" (1/1) ... [2020-07-29 03:26:23,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:23" (1/1) ... [2020-07-29 03:26:23,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:23" (1/1) ... [2020-07-29 03:26:23,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:23" (1/1) ... [2020-07-29 03:26:23,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:23" (1/1) ... [2020-07-29 03:26:23,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:23" (1/1) ... [2020-07-29 03:26:23,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:23" (1/1) ... [2020-07-29 03:26:23,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:26:23,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:26:23,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:26:23,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:26:23,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:26:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:26:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:26:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:26:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:26:23,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:26:23,602 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:26:23,603 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 03:26:23,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:23 BoogieIcfgContainer [2020-07-29 03:26:23,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:26:23,608 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:26:23,608 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:26:23,614 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:26:23,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:23,615 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:26:22" (1/3) ... [2020-07-29 03:26:23,616 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c8bd983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:23, skipping insertion in model container [2020-07-29 03:26:23,616 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:23,616 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:23" (2/3) ... [2020-07-29 03:26:23,617 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c8bd983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:23, skipping insertion in model container [2020-07-29 03:26:23,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:23,617 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:23" (3/3) ... [2020-07-29 03:26:23,618 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlen-alloca-1.i [2020-07-29 03:26:23,671 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:26:23,672 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:26:23,672 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:26:23,672 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:26:23,673 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:26:23,673 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:26:23,673 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:26:23,673 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:26:23,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 03:26:23,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 03:26:23,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:23,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:23,718 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:26:23,718 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:23,718 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:26:23,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 03:26:23,722 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 03:26:23,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:23,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:23,723 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:26:23,723 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:23,732 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~0, main_#t~ret8, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; 7#L524true assume !(main_~length1~0 < 1); 11#L524-2true call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~0 := 0; 5#L528-3true [2020-07-29 03:26:23,732 INFO L796 eck$LassoCheckResult]: Loop: 5#L528-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet7, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet7; 3#L528-2true main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 5#L528-3true [2020-07-29 03:26:23,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:23,738 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 03:26:23,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:23,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193904779] [2020-07-29 03:26:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:23,840 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:23,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:23,874 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:23,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:23,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-07-29 03:26:23,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:23,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234626608] [2020-07-29 03:26:23,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:23,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:23,898 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:23,901 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:23,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:23,903 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-07-29 03:26:23,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:23,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871266465] [2020-07-29 03:26:23,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:23,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:23,948 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:23,953 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:24,217 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-07-29 03:26:24,315 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:24,316 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:24,316 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:24,316 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:24,316 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:24,317 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:24,317 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:24,317 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:24,317 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlen-alloca-1.i_Iteration1_Lasso [2020-07-29 03:26:24,317 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:24,318 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:24,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:24,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:24,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:24,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:24,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:24,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:24,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:24,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:24,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:24,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:25,156 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:25,163 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:25,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:25,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:25,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:25,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:25,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 2 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:25,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:25,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:25,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:25,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:25,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:25,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:25,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:25,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:25,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:25,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:25,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:25,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:25,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:25,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,403 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-07-29 03:26:25,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:25,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:25,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:25,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:25,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:25,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:25,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:25,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:25,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:25,549 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:25,573 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 03:26:25,574 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,589 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:25,624 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:25,625 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:25,626 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-29 03:26:25,731 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 03:26:25,736 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet7, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet7;" "main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6;" [2020-07-29 03:26:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:25,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:25,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:25,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:25,807 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {25#unseeded} is VALID [2020-07-29 03:26:25,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#unseeded} havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~0, main_#t~ret8, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; {25#unseeded} is VALID [2020-07-29 03:26:25,811 INFO L280 TraceCheckUtils]: 2: Hoare triple {25#unseeded} assume !(main_~length1~0 < 1); {25#unseeded} is VALID [2020-07-29 03:26:25,812 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#unseeded} call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~0 := 0; {25#unseeded} is VALID [2020-07-29 03:26:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:25,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:25,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:25,852 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet7, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet7; {67#(and (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} is VALID [2020-07-29 03:26:25,854 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#(and (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; {53#(or (and (> oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:26:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:25,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:25,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:25,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:25,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:25,891 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:26:25,893 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2020-07-29 03:26:26,016 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 45 transitions. Complement of second has 7 states. [2020-07-29 03:26:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:26,017 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:26,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 03:26:26,021 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 03:26:26,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:26,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:26,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:26,034 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:26,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:26,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:26,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2020-07-29 03:26:26,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:26,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:26,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:26,044 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states. [2020-07-29 03:26:26,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 03:26:26,052 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 03:26:26,053 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:26,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:26,061 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:26,061 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 45 transitions. cyclomatic complexity: 14 [2020-07-29 03:26:26,063 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:26,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:26,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:26,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:26,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:26,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:26,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:26,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:26:26,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:26:26,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:26:26,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 03:26:26,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 03:26:26,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 35 letters. Loop has 35 letters. [2020-07-29 03:26:26,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:26:26,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:26:26,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:26:26,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:26,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:26,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:26,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:26:26,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:26:26,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:26:26,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:26,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:26,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:26,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:26:26,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:26:26,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:26:26,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:26,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:26,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:26,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:26,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:26,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:26,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:26,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:26,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:26,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:26,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:26,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:26,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:26:26,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:26:26,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:26:26,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:26,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:26,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:26,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:26:26,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:26:26,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 45 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:26:26,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,105 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-07-29 03:26:26,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:26,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:26,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:26,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. cyclomatic complexity: 14 [2020-07-29 03:26:26,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:26,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 11 states and 14 transitions. [2020-07-29 03:26:26,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 03:26:26,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 03:26:26,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2020-07-29 03:26:26,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:26,122 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 03:26:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2020-07-29 03:26:26,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 03:26:26,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:26,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 03:26:26,149 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 03:26:26,151 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 03:26:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:26,154 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 03:26:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 03:26:26,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:26,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:26,156 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 14 transitions. [2020-07-29 03:26:26,156 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 14 transitions. [2020-07-29 03:26:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:26,157 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 03:26:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 03:26:26,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:26,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:26,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:26,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 03:26:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-07-29 03:26:26,161 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 03:26:26,161 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 03:26:26,161 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:26:26,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-07-29 03:26:26,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:26,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:26,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:26,163 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:26:26,163 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:26,163 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 116#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~0, main_#t~ret8, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; 117#L524 assume !(main_~length1~0 < 1); 126#L524-2 call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~0 := 0; 123#L528-3 assume !(main_~i~0 < main_~length1~0 - 1); 124#L528-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrlen_#in~str.base, cstrlen_#in~str.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 122#L518-4 [2020-07-29 03:26:26,164 INFO L796 eck$LassoCheckResult]: Loop: 122#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 125#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 121#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 122#L518-4 [2020-07-29 03:26:26,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:26,164 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-07-29 03:26:26,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:26,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304769671] [2020-07-29 03:26:26,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:26,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:26,220 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:26,225 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:26,226 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2020-07-29 03:26:26,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:26,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874332834] [2020-07-29 03:26:26,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:26,234 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:26,239 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:26,241 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:26,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:26,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1183925680, now seen corresponding path program 1 times [2020-07-29 03:26:26,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:26,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138185999] [2020-07-29 03:26:26,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:26,531 INFO L280 TraceCheckUtils]: 0: Hoare triple {156#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {156#true} is VALID [2020-07-29 03:26:26,532 INFO L280 TraceCheckUtils]: 1: Hoare triple {156#true} havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~0, main_#t~ret8, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; {156#true} is VALID [2020-07-29 03:26:26,533 INFO L280 TraceCheckUtils]: 2: Hoare triple {156#true} assume !(main_~length1~0 < 1); {158#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:26:26,535 INFO L280 TraceCheckUtils]: 3: Hoare triple {158#(<= 1 ULTIMATE.start_main_~length1~0)} call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~0 := 0; {159#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (or (= 0 ULTIMATE.start_main_~i~0) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:26:26,536 INFO L280 TraceCheckUtils]: 4: Hoare triple {159#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (or (= 0 ULTIMATE.start_main_~i~0) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !(main_~i~0 < main_~length1~0 - 1); {160#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} is VALID [2020-07-29 03:26:26,538 INFO L280 TraceCheckUtils]: 5: Hoare triple {160#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrlen_#in~str.base, cstrlen_#in~str.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; {161#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrlen_~s~0.base) ULTIMATE.start_cstrlen_~s~0.offset))} is VALID [2020-07-29 03:26:26,539 INFO L280 TraceCheckUtils]: 6: Hoare triple {161#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrlen_~s~0.base) ULTIMATE.start_cstrlen_~s~0.offset))} call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); {162#(= 0 |ULTIMATE.start_cstrlen_#t~mem3|)} is VALID [2020-07-29 03:26:26,540 INFO L280 TraceCheckUtils]: 7: Hoare triple {162#(= 0 |ULTIMATE.start_cstrlen_#t~mem3|)} assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; {157#false} is VALID [2020-07-29 03:26:26,540 INFO L280 TraceCheckUtils]: 8: Hoare triple {157#false} cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; {157#false} is VALID [2020-07-29 03:26:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:26,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138185999] [2020-07-29 03:26:26,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:26,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 03:26:26,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853428204] [2020-07-29 03:26:26,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:26,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 03:26:26,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-29 03:26:26,600 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 7 states. [2020-07-29 03:26:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:26,801 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-29 03:26:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:26:26,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:26:26,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:26,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-07-29 03:26:26,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:26,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 14 transitions. [2020-07-29 03:26:26,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 03:26:26,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 03:26:26,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2020-07-29 03:26:26,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:26,820 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-07-29 03:26:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2020-07-29 03:26:26,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-07-29 03:26:26,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:26,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 14 transitions. Second operand 11 states. [2020-07-29 03:26:26,821 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 14 transitions. Second operand 11 states. [2020-07-29 03:26:26,821 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 11 states. [2020-07-29 03:26:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:26,822 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-29 03:26:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2020-07-29 03:26:26,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:26,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:26,823 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 12 states and 14 transitions. [2020-07-29 03:26:26,823 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 12 states and 14 transitions. [2020-07-29 03:26:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:26,824 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-29 03:26:26,825 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2020-07-29 03:26:26,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:26,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:26,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:26,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 03:26:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2020-07-29 03:26:26,826 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 03:26:26,826 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 03:26:26,826 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:26:26,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-07-29 03:26:26,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:26,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:26,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:26,828 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:26,828 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:26,828 INFO L794 eck$LassoCheckResult]: Stem: 186#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 182#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~0, main_#t~ret8, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; 183#L524 assume !(main_~length1~0 < 1); 192#L524-2 call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~0 := 0; 189#L528-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet7, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet7; 184#L528-2 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 185#L528-3 assume !(main_~i~0 < main_~length1~0 - 1); 190#L528-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrlen_#in~str.base, cstrlen_#in~str.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 188#L518-4 [2020-07-29 03:26:26,828 INFO L796 eck$LassoCheckResult]: Loop: 188#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 191#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 187#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 188#L518-4 [2020-07-29 03:26:26,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:26,829 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-07-29 03:26:26,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:26,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043680242] [2020-07-29 03:26:26,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:26,844 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:26,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:26,873 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:26,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:26,874 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 2 times [2020-07-29 03:26:26,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:26,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151026702] [2020-07-29 03:26:26,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:26,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:26,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:26,885 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:26,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1235379726, now seen corresponding path program 1 times [2020-07-29 03:26:26,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:26,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590305938] [2020-07-29 03:26:26,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:26,904 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:26,919 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:26,924 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:27,209 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2020-07-29 03:26:27,357 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:27,357 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:27,357 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:27,357 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:27,357 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:27,357 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:27,358 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:27,358 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:27,358 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlen-alloca-1.i_Iteration3_Lasso [2020-07-29 03:26:27,358 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:27,358 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:27,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:27,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:27,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:27,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:27,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:27,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:27,570 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2020-07-29 03:26:27,644 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:26:27,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:27,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:27,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:27,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:27,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:27,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:27,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:27,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:27,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-07-29 03:26:27,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:28,427 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:28,429 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:28,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:28,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:28,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:28,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:28,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:28,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:28,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:28,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:28,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:28,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:28,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:28,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:28,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:28,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:28,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:28,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:28,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:28,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:28,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:28,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:28,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:28,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:28,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:28,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:28,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:28,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:28,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:28,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:28,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:28,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:28,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:28,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:28,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:28,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:28,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:28,553 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-07-29 03:26:28,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:28,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:28,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:28,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:28,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:28,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:28,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:28,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:28,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-07-29 03:26:28,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:28,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:28,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:28,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:28,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:28,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:28,640 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:28,692 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-07-29 03:26:28,693 INFO L444 ModelExtractionUtils]: 17 out of 31 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:28,706 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:28,709 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:26:28,710 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:28,710 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlen_~s~0.offset) = -2*ULTIMATE.start_cstrlen_~s~0.offset + 3 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2 + 2 >= 0] [2020-07-29 03:26:28,757 INFO L297 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:26:28,765 INFO L393 LassoCheck]: Loop: "call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1);" "assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3;" "cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset;" [2020-07-29 03:26:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:28,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:28,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 03:26:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:28,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:28,874 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 03:26:28,874 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:28,884 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:28,885 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:26:28,885 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2020-07-29 03:26:28,888 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:28,889 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_44|]. (and (<= ULTIMATE.start_main_~i~0 0) (= |#length| (store |v_#length_44| ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~length1~0)) unseeded) [2020-07-29 03:26:28,889 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 0) unseeded) [2020-07-29 03:26:29,051 INFO L280 TraceCheckUtils]: 0: Hoare triple {226#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {226#unseeded} is VALID [2020-07-29 03:26:29,054 INFO L280 TraceCheckUtils]: 1: Hoare triple {226#unseeded} havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~0, main_#t~ret8, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; {226#unseeded} is VALID [2020-07-29 03:26:29,055 INFO L280 TraceCheckUtils]: 2: Hoare triple {226#unseeded} assume !(main_~length1~0 < 1); {226#unseeded} is VALID [2020-07-29 03:26:29,056 INFO L280 TraceCheckUtils]: 3: Hoare triple {226#unseeded} call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~0 := 0; {289#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 0) unseeded)} is VALID [2020-07-29 03:26:29,057 INFO L280 TraceCheckUtils]: 4: Hoare triple {289#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 0) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet7, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet7; {289#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 0) unseeded)} is VALID [2020-07-29 03:26:29,059 INFO L280 TraceCheckUtils]: 5: Hoare triple {289#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 0) unseeded)} main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; {296#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) unseeded (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 03:26:29,060 INFO L280 TraceCheckUtils]: 6: Hoare triple {296#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) unseeded (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < main_~length1~0 - 1); {300#(and (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 2) unseeded)} is VALID [2020-07-29 03:26:29,061 INFO L280 TraceCheckUtils]: 7: Hoare triple {300#(and (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 2) unseeded)} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrlen_#in~str.base, cstrlen_#in~str.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; {271#(and (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrlen_~s~0.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) 2) 0) unseeded)} is VALID [2020-07-29 03:26:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:29,069 WARN L261 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:26:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:29,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:29,117 INFO L280 TraceCheckUtils]: 0: Hoare triple {272#(and (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrlen_~s~0.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) 2) 0) (>= oldRank0 (+ (* (- 2) ULTIMATE.start_cstrlen_~s~0.offset) 3)))} call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); {304#(and (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrlen_~s~0.base) (<= 3 (+ (* 2 ULTIMATE.start_cstrlen_~s~0.offset) oldRank0)) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 2) (<= (+ ULTIMATE.start_cstrlen_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrlen_~s~0.base)))} is VALID [2020-07-29 03:26:29,119 INFO L280 TraceCheckUtils]: 1: Hoare triple {304#(and (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrlen_~s~0.base) (<= 3 (+ (* 2 ULTIMATE.start_cstrlen_~s~0.offset) oldRank0)) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 2) (<= (+ ULTIMATE.start_cstrlen_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrlen_~s~0.base)))} assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; {304#(and (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrlen_~s~0.base) (<= 3 (+ (* 2 ULTIMATE.start_cstrlen_~s~0.offset) oldRank0)) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 2) (<= (+ ULTIMATE.start_cstrlen_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrlen_~s~0.base)))} is VALID [2020-07-29 03:26:29,120 INFO L280 TraceCheckUtils]: 2: Hoare triple {304#(and (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrlen_~s~0.base) (<= 3 (+ (* 2 ULTIMATE.start_cstrlen_~s~0.offset) oldRank0)) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 2) (<= (+ ULTIMATE.start_cstrlen_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrlen_~s~0.base)))} cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; {274#(and (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrlen_~s~0.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) 2) 0) (or unseeded (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_cstrlen_~s~0.offset) 3)) (>= oldRank0 0))))} is VALID [2020-07-29 03:26:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:29,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:26:29,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:29,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:29,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,140 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2020-07-29 03:26:29,141 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 6 states. [2020-07-29 03:26:29,367 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 23 states and 27 transitions. Complement of second has 9 states. [2020-07-29 03:26:29,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2020-07-29 03:26:29,367 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:29,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 03:26:29,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:29,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:29,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 03:26:29,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:29,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:29,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:29,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2020-07-29 03:26:29,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:29,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:29,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:29,371 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 03:26:29,372 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:29,372 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 03:26:29,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:29,373 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:29,373 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 27 transitions. cyclomatic complexity: 7 [2020-07-29 03:26:29,374 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:29,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:29,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:29,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:29,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:29,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:29,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:29,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:29,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:29,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:29,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 23 letters. Loop has 23 letters. [2020-07-29 03:26:29,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 03:26:29,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 7 Stem has 23 letters. Loop has 23 letters. [2020-07-29 03:26:29,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 03:26:29,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 03:26:29,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 11 letters. [2020-07-29 03:26:29,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:26:29,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:26:29,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:26:29,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:29,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:29,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:29,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:29,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:29,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:29,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:29,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:29,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:29,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:29,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:29,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:29,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:29,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:29,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:29,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:29,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:29,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:29,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:29,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:29,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 27 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:29,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,386 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:29,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 03:26:29,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2020-07-29 03:26:29,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:29,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:29,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 8 letters. Loop has 6 letters. [2020-07-29 03:26:29,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:29,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 27 transitions. cyclomatic complexity: 7 [2020-07-29 03:26:29,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:29,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 16 states and 18 transitions. [2020-07-29 03:26:29,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 03:26:29,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 03:26:29,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2020-07-29 03:26:29,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:29,392 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-29 03:26:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2020-07-29 03:26:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2020-07-29 03:26:29,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:29,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 18 transitions. Second operand 13 states. [2020-07-29 03:26:29,393 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 18 transitions. Second operand 13 states. [2020-07-29 03:26:29,394 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 13 states. [2020-07-29 03:26:29,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:29,395 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-29 03:26:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-29 03:26:29,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:29,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:29,395 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 16 states and 18 transitions. [2020-07-29 03:26:29,396 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 16 states and 18 transitions. [2020-07-29 03:26:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:29,397 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-29 03:26:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-29 03:26:29,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:29,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:29,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:29,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 03:26:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2020-07-29 03:26:29,399 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-07-29 03:26:29,399 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-07-29 03:26:29,399 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:26:29,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2020-07-29 03:26:29,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:29,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:29,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:29,400 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:29,400 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:29,400 INFO L794 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 354#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~0, main_#t~ret8, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; 355#L524 assume !(main_~length1~0 < 1); 365#L524-2 call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~0 := 0; 361#L528-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet7, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet7; 356#L528-2 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 357#L528-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet7, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet7; 362#L528-2 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 366#L528-3 assume !(main_~i~0 < main_~length1~0 - 1); 364#L528-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrlen_#in~str.base, cstrlen_#in~str.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 360#L518-4 [2020-07-29 03:26:29,401 INFO L796 eck$LassoCheckResult]: Loop: 360#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 363#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 359#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 360#L518-4 [2020-07-29 03:26:29,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:29,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2020-07-29 03:26:29,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:29,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869709955] [2020-07-29 03:26:29,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:29,416 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:29,427 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:29,431 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:29,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:29,432 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 3 times [2020-07-29 03:26:29,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:29,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395614724] [2020-07-29 03:26:29,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:29,436 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:29,439 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:29,441 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:29,441 INFO L82 PathProgramCache]: Analyzing trace with hash -856889620, now seen corresponding path program 2 times [2020-07-29 03:26:29,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:29,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212103333] [2020-07-29 03:26:29,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:29,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:29,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:29,503 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:29,849 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2020-07-29 03:26:29,988 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:29,988 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:29,988 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:29,988 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:29,988 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:29,989 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:29,989 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:29,989 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:29,989 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlen-alloca-1.i_Iteration4_Lasso [2020-07-29 03:26:29,989 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:29,989 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:30,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:30,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-07-29 03:26:30,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:30,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-07-29 03:26:30,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:30,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:30,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-07-29 03:26:30,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:30,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:30,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-07-29 03:26:30,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:30,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:30,264 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:30,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:30,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:30,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:30,935 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:30,935 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:30,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:30,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:30,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:30,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:30,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:30,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:30,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:30,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:30,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:30,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:30,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:30,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:30,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:30,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:30,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:30,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:30,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:30,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:31,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:31,021 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) [2020-07-29 03:26:31,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:31,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:31,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:31,073 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-07-29 03:26:31,110 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:31,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:31,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:31,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:31,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:31,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:31,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:31,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:31,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:31,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:31,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:31,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:31,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:31,242 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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:31,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:31,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:31,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:31,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:31,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:31,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:31,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:31,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:31,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:31,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:31,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:31,422 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:31,509 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2020-07-29 03:26:31,509 INFO L444 ModelExtractionUtils]: 8 out of 34 variables were initially zero. Simplification set additionally 23 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,511 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:31,513 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:31,514 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:31,514 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_3, ULTIMATE.start_cstrlen_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_3 - 1*ULTIMATE.start_cstrlen_~s~0.offset Supporting invariants [] [2020-07-29 03:26:31,554 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2020-07-29 03:26:31,560 INFO L393 LassoCheck]: Loop: "call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1);" "assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3;" "cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset;" [2020-07-29 03:26:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:31,568 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:31,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:31,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:26:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:31,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:31,621 INFO L280 TraceCheckUtils]: 0: Hoare triple {408#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {408#unseeded} is VALID [2020-07-29 03:26:31,622 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#unseeded} havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~0, main_#t~ret8, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; {408#unseeded} is VALID [2020-07-29 03:26:31,622 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#unseeded} assume !(main_~length1~0 < 1); {408#unseeded} is VALID [2020-07-29 03:26:31,623 INFO L280 TraceCheckUtils]: 3: Hoare triple {408#unseeded} call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~0 := 0; {408#unseeded} is VALID [2020-07-29 03:26:31,623 INFO L280 TraceCheckUtils]: 4: Hoare triple {408#unseeded} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet7, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet7; {408#unseeded} is VALID [2020-07-29 03:26:31,624 INFO L280 TraceCheckUtils]: 5: Hoare triple {408#unseeded} main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; {408#unseeded} is VALID [2020-07-29 03:26:31,625 INFO L280 TraceCheckUtils]: 6: Hoare triple {408#unseeded} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet7, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet7; {408#unseeded} is VALID [2020-07-29 03:26:31,626 INFO L280 TraceCheckUtils]: 7: Hoare triple {408#unseeded} main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; {408#unseeded} is VALID [2020-07-29 03:26:31,626 INFO L280 TraceCheckUtils]: 8: Hoare triple {408#unseeded} assume !(main_~i~0 < main_~length1~0 - 1); {408#unseeded} is VALID [2020-07-29 03:26:31,627 INFO L280 TraceCheckUtils]: 9: Hoare triple {408#unseeded} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrlen_#in~str.base, cstrlen_#in~str.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; {447#(and (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrlen_~s~0.base) unseeded)} is VALID [2020-07-29 03:26:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:31,633 WARN L261 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:26:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:31,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:31,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {448#(and (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrlen_~s~0.base) (>= oldRank0 (+ (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (* (- 1) ULTIMATE.start_cstrlen_~s~0.offset))))} call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); {483#(and (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrlen_~s~0.base) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_cstrlen_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrlen_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrlen_~s~0.base)))} is VALID [2020-07-29 03:26:31,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {483#(and (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrlen_~s~0.base) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_cstrlen_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrlen_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrlen_~s~0.base)))} assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; {483#(and (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrlen_~s~0.base) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_cstrlen_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrlen_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrlen_~s~0.base)))} is VALID [2020-07-29 03:26:31,677 INFO L280 TraceCheckUtils]: 2: Hoare triple {483#(and (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrlen_~s~0.base) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_cstrlen_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrlen_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrlen_~s~0.base)))} cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; {450#(and (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrlen_~s~0.base) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (* (- 1) ULTIMATE.start_cstrlen_~s~0.offset)))) unseeded))} is VALID [2020-07-29 03:26:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:31,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:31,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:31,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:31,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,692 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:26:31,692 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-29 03:26:31,758 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2020-07-29 03:26:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:31,759 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:31,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. cyclomatic complexity: 4 [2020-07-29 03:26:31,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:31,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:31,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:31,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:31,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:31,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:31,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2020-07-29 03:26:31,762 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:31,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:31,762 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 15 transitions. cyclomatic complexity: 4 [2020-07-29 03:26:31,763 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:31,763 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:31,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:31,764 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:31,764 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2020-07-29 03:26:31,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2020-07-29 03:26:31,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:31,765 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:26:31,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:31,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:31,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:31,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:31,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:31,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:31,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:26:31,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:26:31,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:26:31,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:26:31,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:26:31,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:26:31,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:31,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:31,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:31,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:31,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:31,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:31,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:31,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:31,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:31,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:31,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:31,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:31,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:31,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:31,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:31,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,774 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2020-07-29 03:26:31,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:31,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:31,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:26:31,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2020-07-29 03:26:31,777 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:31,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-07-29 03:26:31,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:26:31,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:26:31,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:26:31,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:31,778 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:31,778 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:31,778 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:31,778 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:26:31,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:26:31,778 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:31,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:31,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:26:31 BoogieIcfgContainer [2020-07-29 03:26:31,785 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:26:31,786 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:26:31,786 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:26:31,786 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:26:31,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:23" (3/4) ... [2020-07-29 03:26:31,791 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:26:31,791 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:26:31,793 INFO L168 Benchmark]: Toolchain (without parser) took 9289.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.3 MB). Free memory was 957.5 MB in the beginning and 894.1 MB in the end (delta: 63.5 MB). Peak memory consumption was 392.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:31,794 INFO L168 Benchmark]: CDTParser took 1.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:31,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:31,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:31,795 INFO L168 Benchmark]: Boogie Preprocessor took 29.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:31,796 INFO L168 Benchmark]: RCFGBuilder took 432.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:31,797 INFO L168 Benchmark]: BuchiAutomizer took 8177.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 894.1 MB in the end (delta: 192.0 MB). Peak memory consumption was 383.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:31,797 INFO L168 Benchmark]: Witness Printer took 5.05 ms. Allocated memory is still 1.4 GB. Free memory is still 894.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:31,801 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 581.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 432.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8177.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 894.1 MB in the end (delta: 192.0 MB). Peak memory consumption was 383.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.05 ms. Allocated memory is still 1.4 GB. Free memory is still 894.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * s + 3 and consists of 7 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * s and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 6.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 35 SDtfs, 51 SDslu, 42 SDs, 0 SdLazy, 73 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital120 mio100 ax115 hnf99 lsp81 ukn86 mio100 lsp58 div100 bol100 ite100 ukn100 eq173 hnf89 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...