./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/subseq-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/subseq-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20f541ceeb4d88c1ded29d751212bcde5b7dc0f0 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 21:26:12,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:26:12,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:26:12,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:26:12,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:26:12,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:26:12,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:26:12,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:26:12,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:26:12,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:26:12,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:26:12,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:26:12,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:26:12,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:26:12,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:26:12,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:26:12,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:26:12,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:26:12,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:26:12,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:26:12,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:26:12,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:26:12,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:26:12,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:26:12,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:26:12,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:26:12,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:26:12,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:26:12,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:26:12,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:26:12,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:26:12,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:26:12,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:26:12,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:26:12,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:26:12,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:26:12,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:26:12,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:26:12,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:26:12,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:26:12,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:26:12,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:26:12,262 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:26:12,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:26:12,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:26:12,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:26:12,264 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:26:12,264 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:26:12,265 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:26:12,265 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:26:12,265 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:26:12,265 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:26:12,266 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:26:12,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:26:12,266 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:26:12,267 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:26:12,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:26:12,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:26:12,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:26:12,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:26:12,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:26:12,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:26:12,269 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:26:12,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:26:12,269 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:26:12,269 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:26:12,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:26:12,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:26:12,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:26:12,271 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:26:12,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:26:12,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:26:12,272 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:26:12,272 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:26:12,273 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:26:12,273 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 -> 20f541ceeb4d88c1ded29d751212bcde5b7dc0f0 [2019-11-28 21:26:12,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:26:12,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:26:12,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:26:12,628 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:26:12,628 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:26:12,629 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/subseq-alloca-2.i [2019-11-28 21:26:12,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7a69512/cc54434ec0404c618e9012c890677473/FLAG1e0ef6505 [2019-11-28 21:26:13,256 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:26:13,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/subseq-alloca-2.i [2019-11-28 21:26:13,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7a69512/cc54434ec0404c618e9012c890677473/FLAG1e0ef6505 [2019-11-28 21:26:13,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7a69512/cc54434ec0404c618e9012c890677473 [2019-11-28 21:26:13,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:26:13,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:26:13,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:26:13,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:26:13,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:26:13,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:26:13" (1/1) ... [2019-11-28 21:26:13,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef930b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:13, skipping insertion in model container [2019-11-28 21:26:13,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:26:13" (1/1) ... [2019-11-28 21:26:13,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:26:13,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:26:14,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:26:14,120 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:26:14,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:26:14,241 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:26:14,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:14 WrapperNode [2019-11-28 21:26:14,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:26:14,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:26:14,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:26:14,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:26:14,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:14" (1/1) ... [2019-11-28 21:26:14,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:14" (1/1) ... [2019-11-28 21:26:14,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:26:14,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:26:14,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:26:14,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:26:14,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:14" (1/1) ... [2019-11-28 21:26:14,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:14" (1/1) ... [2019-11-28 21:26:14,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:14" (1/1) ... [2019-11-28 21:26:14,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:14" (1/1) ... [2019-11-28 21:26:14,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:14" (1/1) ... [2019-11-28 21:26:14,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:14" (1/1) ... [2019-11-28 21:26:14,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:14" (1/1) ... [2019-11-28 21:26:14,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:26:14,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:26:14,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:26:14,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:26:14,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:14" (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 [2019-11-28 21:26:14,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 21:26:14,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 21:26:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:26:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 21:26:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:26:14,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:26:14,767 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:26:14,767 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-28 21:26:14,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:14 BoogieIcfgContainer [2019-11-28 21:26:14,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:26:14,770 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:26:14,770 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:26:14,774 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:26:14,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:14,778 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:26:13" (1/3) ... [2019-11-28 21:26:14,780 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d2a281a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:26:14, skipping insertion in model container [2019-11-28 21:26:14,780 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:14,781 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:14" (2/3) ... [2019-11-28 21:26:14,781 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d2a281a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:26:14, skipping insertion in model container [2019-11-28 21:26:14,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:14,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:14" (3/3) ... [2019-11-28 21:26:14,783 INFO L371 chiAutomizerObserver]: Analyzing ICFG subseq-alloca-2.i [2019-11-28 21:26:14,834 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:26:14,834 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:26:14,835 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:26:14,835 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:26:14,835 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:26:14,835 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:26:14,835 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:26:14,835 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:26:14,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-28 21:26:14,873 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 21:26:14,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:14,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:14,882 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:26:14,882 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:26:14,882 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:26:14,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-28 21:26:14,885 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 21:26:14,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:14,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:14,885 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:26:14,886 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:26:14,894 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 18#L530true assume !(main_~length1~0 < 1); 21#L530-2true assume !(main_~length2~0 < 1); 13#L533-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 5#L539-3true [2019-11-28 21:26:14,895 INFO L796 eck$LassoCheckResult]: Loop: 5#L539-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 3#L539-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 5#L539-3true [2019-11-28 21:26:14,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:14,901 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-28 21:26:14,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:14,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319764056] [2019-11-28 21:26:14,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:15,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:15,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:15,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-28 21:26:15,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:15,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785118857] [2019-11-28 21:26:15,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:15,079 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:15,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:15,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-28 21:26:15,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:15,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226676856] [2019-11-28 21:26:15,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:15,145 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:15,450 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-28 21:26:15,550 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:15,553 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:15,553 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:15,553 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:15,554 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:15,554 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:15,554 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:15,554 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:15,554 INFO L133 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-2.i_Iteration1_Lasso [2019-11-28 21:26:15,555 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:15,555 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:15,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,771 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-28 21:26:15,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:16,182 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:16,189 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) [2019-11-28 21:26:16,206 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 [2019-11-28 21:26:16,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:16,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:16,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:16,240 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 [2019-11-28 21:26:16,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:16,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:16,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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:16,283 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 [2019-11-28 21:26:16,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:16,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,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) [2019-11-28 21:26:16,310 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 [2019-11-28 21:26:16,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:16,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:16,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,323 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) [2019-11-28 21:26:16,340 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 [2019-11-28 21:26:16,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:16,363 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 [2019-11-28 21:26:16,380 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:16,492 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 21:26:16,492 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,549 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:26:16,555 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:26:16,555 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:16,556 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1) = -1*ULTIMATE.start_main_~nondetString1~0.offset - 1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 Supporting invariants [] [2019-11-28 21:26:16,582 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 21:26:16,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:26:16,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:16,646 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:26:16,648 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:16,664 WARN L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 21:26:16,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:16,706 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 [2019-11-28 21:26:16,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2019-11-28 21:26:16,849 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 51 states and 76 transitions. Complement of second has 8 states. [2019-11-28 21:26:16,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:26:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:26:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2019-11-28 21:26:16,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 21:26:16,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:16,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 21:26:16,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:16,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 21:26:16,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:16,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 76 transitions. [2019-11-28 21:26:16,875 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 21:26:16,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 24 transitions. [2019-11-28 21:26:16,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 21:26:16,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 21:26:16,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-11-28 21:26:16,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:16,886 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 21:26:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-11-28 21:26:16,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 21:26:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 21:26:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-28 21:26:16,922 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 21:26:16,923 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 21:26:16,923 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:26:16,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-28 21:26:16,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 21:26:16,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:16,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:16,928 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:16,929 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:26:16,929 INFO L794 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 161#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 162#L530 assume !(main_~length1~0 < 1); 166#L530-2 assume !(main_~length2~0 < 1); 163#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 155#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 156#L539-4 main_~i~1 := 0; 157#L545-3 [2019-11-28 21:26:16,929 INFO L796 eck$LassoCheckResult]: Loop: 157#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 160#L545-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 157#L545-3 [2019-11-28 21:26:16,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:16,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-28 21:26:16,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:16,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130098133] [2019-11-28 21:26:16,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,002 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:17,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:17,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-28 21:26:17,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:17,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114604206] [2019-11-28 21:26:17,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,034 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:17,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:17,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-11-28 21:26:17,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:17,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707565574] [2019-11-28 21:26:17,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,109 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:17,347 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-28 21:26:17,428 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:17,428 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:17,429 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:17,429 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:17,429 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:17,429 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:17,429 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:17,429 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:17,430 INFO L133 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-2.i_Iteration2_Lasso [2019-11-28 21:26:17,430 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:17,430 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:17,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:17,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:17,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:17,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:17,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:17,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:17,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:17,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:17,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:17,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:17,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:17,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:17,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:17,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:17,949 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:17,949 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 21:26:17,957 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:17,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:17,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:17,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:17,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:17,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:17,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:17,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:17,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:17,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:17,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:17,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:17,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:17,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:17,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:17,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:17,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:17,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:18,011 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 [2019-11-28 21:26:18,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:18,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:18,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:18,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:18,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:18,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:18,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:18,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:18,036 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 [2019-11-28 21:26:18,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:18,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:18,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:18,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:18,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:18,045 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:18,051 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) [2019-11-28 21:26:18,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:18,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:18,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:18,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:18,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:18,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:18,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:18,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:18,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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:18,086 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:18,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:18,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:18,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:18,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:18,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:18,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:18,100 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) [2019-11-28 21:26:18,116 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 [2019-11-28 21:26:18,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:18,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:18,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:18,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:18,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:18,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:18,129 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) [2019-11-28 21:26:18,145 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 [2019-11-28 21:26:18,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:18,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:18,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:18,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:18,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:18,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:18,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:18,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 15 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 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 [2019-11-28 21:26:18,166 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 [2019-11-28 21:26:18,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:18,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:18,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:18,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:18,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:18,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:18,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:18,195 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 [2019-11-28 21:26:18,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:18,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:18,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:18,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:18,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:18,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:18,220 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:18,250 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 21:26:18,251 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:18,258 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:18,264 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:26:18,264 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:18,265 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-11-28 21:26:18,288 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 21:26:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:18,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:26:18,317 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:18,324 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:26:18,324 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:18,338 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 [2019-11-28 21:26:18,338 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 21:26:18,361 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 25 states and 38 transitions. Complement of second has 6 states. [2019-11-28 21:26:18,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:26:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:26:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-11-28 21:26:18,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 21:26:18,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:18,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-28 21:26:18,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:18,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-28 21:26:18,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:18,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 38 transitions. [2019-11-28 21:26:18,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:26:18,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2019-11-28 21:26:18,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 21:26:18,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 21:26:18,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-28 21:26:18,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:18,367 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 21:26:18,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-28 21:26:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-28 21:26:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 21:26:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-11-28 21:26:18,370 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 21:26:18,370 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 21:26:18,370 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:26:18,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-11-28 21:26:18,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:26:18,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:18,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:18,372 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:18,372 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 21:26:18,372 INFO L794 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 278#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 279#L530 assume !(main_~length1~0 < 1); 283#L530-2 assume !(main_~length2~0 < 1); 280#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 271#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 272#L539-4 main_~i~1 := 0; 273#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 281#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 274#L518-5 [2019-11-28 21:26:18,372 INFO L796 eck$LassoCheckResult]: Loop: 274#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 275#L518-1 assume subseq_#t~short4;call subseq_#t~mem3 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem3; 269#L518-3 assume !!subseq_#t~short4;havoc subseq_#t~mem2;havoc subseq_#t~short4;havoc subseq_#t~mem3;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 270#L519 assume !(subseq_#t~mem5 == subseq_#t~mem6);havoc subseq_#t~mem6;havoc subseq_#t~mem5; 284#L519-2 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 274#L518-5 [2019-11-28 21:26:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-11-28 21:26:18,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:18,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361431210] [2019-11-28 21:26:18,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:18,419 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:18,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:18,421 INFO L82 PathProgramCache]: Analyzing trace with hash 74536249, now seen corresponding path program 1 times [2019-11-28 21:26:18,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:18,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072771025] [2019-11-28 21:26:18,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:18,460 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:18,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:18,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1034036476, now seen corresponding path program 1 times [2019-11-28 21:26:18,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:18,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881499208] [2019-11-28 21:26:18,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:18,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881499208] [2019-11-28 21:26:18,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:18,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 21:26:18,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467280493] [2019-11-28 21:26:18,951 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-11-28 21:26:18,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:18,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 21:26:18,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 21:26:18,995 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand 9 states. [2019-11-28 21:26:19,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:19,382 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-28 21:26:19,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 21:26:19,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2019-11-28 21:26:19,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-28 21:26:19,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2019-11-28 21:26:19,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 21:26:19,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 21:26:19,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2019-11-28 21:26:19,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:19,388 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-11-28 21:26:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2019-11-28 21:26:19,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-11-28 21:26:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 21:26:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2019-11-28 21:26:19,392 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-11-28 21:26:19,393 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-11-28 21:26:19,393 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:26:19,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 38 transitions. [2019-11-28 21:26:19,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 21:26:19,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:19,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:19,397 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:19,397 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 21:26:19,397 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 366#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 367#L530 assume !(main_~length1~0 < 1); 374#L530-2 assume !(main_~length2~0 < 1); 368#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 358#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 359#L539-4 main_~i~1 := 0; 361#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 369#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 379#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 376#L518-1 assume !subseq_#t~short4; 356#L518-3 [2019-11-28 21:26:19,397 INFO L796 eck$LassoCheckResult]: Loop: 356#L518-3 assume !!subseq_#t~short4;havoc subseq_#t~mem2;havoc subseq_#t~short4;havoc subseq_#t~mem3;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 357#L519 assume subseq_#t~mem5 == subseq_#t~mem6;havoc subseq_#t~mem6;havoc subseq_#t~mem5;subseq_#t~post7.base, subseq_#t~post7.offset := subseq_~ps~0.base, subseq_~ps~0.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_#t~post7.base, 1 + subseq_#t~post7.offset;havoc subseq_#t~post7.base, subseq_#t~post7.offset; 375#L519-2 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 362#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 363#L518-1 assume !subseq_#t~short4; 356#L518-3 [2019-11-28 21:26:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:19,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759909, now seen corresponding path program 1 times [2019-11-28 21:26:19,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:19,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066080134] [2019-11-28 21:26:19,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:19,428 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:19,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:19,428 INFO L82 PathProgramCache]: Analyzing trace with hash 85028899, now seen corresponding path program 1 times [2019-11-28 21:26:19,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:19,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884592754] [2019-11-28 21:26:19,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:19,444 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:19,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1514407799, now seen corresponding path program 1 times [2019-11-28 21:26:19,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:19,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422184208] [2019-11-28 21:26:19,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:19,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:19,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422184208] [2019-11-28 21:26:19,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:19,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:26:19,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019702941] [2019-11-28 21:26:19,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:19,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:26:19,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:26:19,613 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-11-28 21:26:19,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:19,628 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2019-11-28 21:26:19,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:26:19,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2019-11-28 21:26:19,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:26:19,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 36 transitions. [2019-11-28 21:26:19,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-28 21:26:19,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 21:26:19,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-28 21:26:19,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:19,634 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-28 21:26:19,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-28 21:26:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 21:26:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 21:26:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2019-11-28 21:26:19,638 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-28 21:26:19,638 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-28 21:26:19,638 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:26:19,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2019-11-28 21:26:19,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:26:19,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:19,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:19,646 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:19,646 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 21:26:19,646 INFO L794 eck$LassoCheckResult]: Stem: 434#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 429#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 430#L530 assume !(main_~length1~0 < 1); 436#L530-2 assume !(main_~length2~0 < 1); 431#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 421#L539-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 417#L539-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 418#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 423#L539-4 main_~i~1 := 0; 424#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 435#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 425#L518-5 [2019-11-28 21:26:19,647 INFO L796 eck$LassoCheckResult]: Loop: 425#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 426#L518-1 assume subseq_#t~short4;call subseq_#t~mem3 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem3; 419#L518-3 assume !!subseq_#t~short4;havoc subseq_#t~mem2;havoc subseq_#t~short4;havoc subseq_#t~mem3;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 420#L519 assume !(subseq_#t~mem5 == subseq_#t~mem6);havoc subseq_#t~mem6;havoc subseq_#t~mem5; 438#L519-2 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 425#L518-5 [2019-11-28 21:26:19,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:19,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-28 21:26:19,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:19,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278106615] [2019-11-28 21:26:19,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:19,693 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:19,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:19,693 INFO L82 PathProgramCache]: Analyzing trace with hash 74536249, now seen corresponding path program 2 times [2019-11-28 21:26:19,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:19,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877214973] [2019-11-28 21:26:19,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:19,717 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:19,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:19,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1928298466, now seen corresponding path program 1 times [2019-11-28 21:26:19,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:19,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782429899] [2019-11-28 21:26:19,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 21:26:19,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782429899] [2019-11-28 21:26:19,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:19,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 21:26:19,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507571163] [2019-11-28 21:26:19,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:19,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 21:26:19,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-28 21:26:19,991 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 13 Second operand 8 states. [2019-11-28 21:26:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:20,084 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-11-28 21:26:20,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 21:26:20,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2019-11-28 21:26:20,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:26:20,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 29 states and 36 transitions. [2019-11-28 21:26:20,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-28 21:26:20,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 21:26:20,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-11-28 21:26:20,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:20,087 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-28 21:26:20,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-11-28 21:26:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-11-28 21:26:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 21:26:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-28 21:26:20,090 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-28 21:26:20,090 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-28 21:26:20,090 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 21:26:20,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-11-28 21:26:20,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:26:20,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:20,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:20,091 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:20,092 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 21:26:20,092 INFO L794 eck$LassoCheckResult]: Stem: 518#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 512#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 513#L530 assume !(main_~length1~0 < 1); 520#L530-2 assume !(main_~length2~0 < 1); 514#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 504#L539-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 500#L539-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 501#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 506#L539-4 main_~i~1 := 0; 515#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 516#L545-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 526#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 519#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 508#L518-5 [2019-11-28 21:26:20,092 INFO L796 eck$LassoCheckResult]: Loop: 508#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 509#L518-1 assume subseq_#t~short4;call subseq_#t~mem3 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem3; 502#L518-3 assume !!subseq_#t~short4;havoc subseq_#t~mem2;havoc subseq_#t~short4;havoc subseq_#t~mem3;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 503#L519 assume !(subseq_#t~mem5 == subseq_#t~mem6);havoc subseq_#t~mem6;havoc subseq_#t~mem5; 522#L519-2 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 508#L518-5 [2019-11-28 21:26:20,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:20,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-28 21:26:20,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:20,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606648513] [2019-11-28 21:26:20,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:20,117 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:20,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:20,117 INFO L82 PathProgramCache]: Analyzing trace with hash 74536249, now seen corresponding path program 3 times [2019-11-28 21:26:20,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:20,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572148124] [2019-11-28 21:26:20,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:20,126 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:20,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1075475712, now seen corresponding path program 1 times [2019-11-28 21:26:20,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:20,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557427132] [2019-11-28 21:26:20,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:20,183 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:20,294 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-11-28 21:26:20,844 WARN L192 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 116 [2019-11-28 21:26:21,092 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-28 21:26:21,096 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:21,096 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:21,096 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:21,096 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:21,096 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:21,096 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:21,097 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:21,097 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:21,097 INFO L133 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-2.i_Iteration6_Lasso [2019-11-28 21:26:21,097 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:21,097 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:21,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,632 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2019-11-28 21:26:21,795 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-11-28 21:26:21,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:21,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:22,029 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-28 21:26:22,391 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-28 21:26:22,592 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-11-28 21:26:22,648 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:22,648 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,659 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 [2019-11-28 21:26:22,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:22,662 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 [2019-11-28 21:26:22,669 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 [2019-11-28 21:26:22,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:22,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,687 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 [2019-11-28 21:26:22,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:22,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,697 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 [2019-11-28 21:26:22,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:22,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:22,711 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) [2019-11-28 21:26:22,721 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 [2019-11-28 21:26:22,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,726 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) [2019-11-28 21:26:22,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:22,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:22,748 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 [2019-11-28 21:26:22,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,753 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) [2019-11-28 21:26:22,762 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 [2019-11-28 21:26:22,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,766 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) [2019-11-28 21:26:22,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:22,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,786 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 [2019-11-28 21:26:22,791 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 [2019-11-28 21:26:22,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:22,796 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 [2019-11-28 21:26:22,805 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 [2019-11-28 21:26:22,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:22,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:22,812 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 [2019-11-28 21:26:22,818 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 [2019-11-28 21:26:22,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:22,821 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 [2019-11-28 21:26:22,827 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 [2019-11-28 21:26:22,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:22,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-11-28 21:26:22,836 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 [2019-11-28 21:26:22,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:22,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:22,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,849 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 [2019-11-28 21:26:22,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:22,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:22,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:22,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:22,874 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 [2019-11-28 21:26:22,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:22,884 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 [2019-11-28 21:26:22,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:22,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:22,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:22,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:22,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:22,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:22,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:22,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:22,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:22,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:22,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:22,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:22,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:22,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:22,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:22,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:22,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:22,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:22,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:23,031 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:23,135 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2019-11-28 21:26:23,135 INFO L444 ModelExtractionUtils]: 20 out of 55 variables were initially zero. Simplification set additionally 30 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:23,143 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:23,146 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 21:26:23,147 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:23,147 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_subseq_~pt~0.offset, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_subseq_~pt~0.offset + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 + 1*ULTIMATE.start_main_~length2~0 >= 0] [2019-11-28 21:26:23,248 INFO L297 tatePredicateManager]: 24 out of 26 supporting invariants were superfluous and have been removed [2019-11-28 21:26:23,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:23,303 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 21:26:23,304 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:23,348 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:26:23,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-28 21:26:23,349 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:26:23,371 INFO L614 ElimStorePlain]: treesize reduction 10, result has 65.5 percent of original size [2019-11-28 21:26:23,372 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:26:23,373 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2019-11-28 21:26:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:23,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 21:26:23,401 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:23,420 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 21:26:23,420 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-28 21:26:23,478 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 35 states and 45 transitions. Complement of second has 7 states. [2019-11-28 21:26:23,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:26:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 21:26:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-11-28 21:26:23,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 5 letters. [2019-11-28 21:26:23,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:23,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 5 letters. [2019-11-28 21:26:23,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:23,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 10 letters. [2019-11-28 21:26:23,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:23,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2019-11-28 21:26:23,483 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:26:23,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2019-11-28 21:26:23,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:26:23,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:26:23,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:26:23,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:23,484 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:26:23,485 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:26:23,485 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:26:23,485 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 21:26:23,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 21:26:23,485 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:26:23,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 21:26:23,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:26:23 BoogieIcfgContainer [2019-11-28 21:26:23,493 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:26:23,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:26:23,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:26:23,494 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:26:23,495 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:14" (3/4) ... [2019-11-28 21:26:23,499 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 21:26:23,500 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:26:23,507 INFO L168 Benchmark]: Toolchain (without parser) took 9902.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.3 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -291.3 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:23,512 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:23,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:23,516 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.76 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:23,516 INFO L168 Benchmark]: Boogie Preprocessor took 27.95 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. [2019-11-28 21:26:23,517 INFO L168 Benchmark]: RCFGBuilder took 419.55 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:23,519 INFO L168 Benchmark]: BuchiAutomizer took 8723.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -144.3 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:23,519 INFO L168 Benchmark]: Witness Printer took 5.53 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:23,527 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 641.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.76 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.95 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 419.55 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8723.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -144.3 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.53 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * nondetString1 + -1 * i + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function -1 * pt + length2 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.6s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 7.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 96 SDtfs, 182 SDslu, 150 SDs, 0 SdLazy, 161 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital202 mio100 ax110 hnf98 lsp84 ukn73 mio100 lsp49 div100 bol100 ite100 ukn100 eq177 hnf89 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms VariablesStem: 2 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...