./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrpbrk-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/cstrpbrk-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 5cff20f2f9db1407772cc4ac909fa32770d83e71 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:25:30,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:25:30,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:25:30,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:25:30,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:25:30,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:25:30,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:25:30,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:25:30,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:25:30,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:25:30,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:25:30,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:25:30,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:25:30,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:25:30,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:25:30,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:25:30,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:25:30,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:25:30,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:25:30,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:25:30,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:25:30,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:25:30,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:25:30,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:25:30,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:25:30,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:25:30,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:25:30,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:25:30,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:25:30,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:25:30,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:25:30,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:25:30,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:25:30,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:25:30,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:25:30,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:25:30,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:25:30,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:25:30,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:25:30,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:25:30,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:25:30,387 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:25:30,404 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:25:30,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:25:30,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:25:30,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:25:30,406 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:25:30,406 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:25:30,406 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:25:30,407 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:25:30,407 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:25:30,407 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:25:30,408 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:25:30,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:25:30,408 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:25:30,408 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:25:30,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:25:30,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:25:30,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:25:30,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:25:30,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:25:30,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:25:30,410 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:25:30,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:25:30,411 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:25:30,411 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:25:30,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:25:30,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:25:30,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:25:30,412 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:25:30,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:25:30,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:25:30,413 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:25:30,413 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:25:30,414 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:25:30,415 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 -> 5cff20f2f9db1407772cc4ac909fa32770d83e71 [2019-11-28 21:25:30,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:25:30,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:25:30,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:25:30,763 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:25:30,764 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:25:30,765 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2019-11-28 21:25:30,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52c2a0b22/0320a2dc81084235b14e85f6de22efd1/FLAG2329f94a6 [2019-11-28 21:25:31,347 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:25:31,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2019-11-28 21:25:31,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52c2a0b22/0320a2dc81084235b14e85f6de22efd1/FLAG2329f94a6 [2019-11-28 21:25:31,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52c2a0b22/0320a2dc81084235b14e85f6de22efd1 [2019-11-28 21:25:31,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:25:31,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:25:31,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:25:31,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:25:31,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:25:31,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:25:31" (1/1) ... [2019-11-28 21:25:31,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cfe08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:31, skipping insertion in model container [2019-11-28 21:25:31,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:25:31" (1/1) ... [2019-11-28 21:25:31,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:25:31,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:25:32,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:25:32,225 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:25:32,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:25:32,330 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:25:32,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32 WrapperNode [2019-11-28 21:25:32,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:25:32,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:25:32,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:25:32,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:25:32,342 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:25:32" (1/1) ... [2019-11-28 21:25:32,364 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:25:32" (1/1) ... [2019-11-28 21:25:32,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:25:32,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:25:32,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:25:32,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:25:32,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:25:32,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:25:32,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:25:32,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:25:32,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (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:25:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 21:25:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 21:25:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:25:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 21:25:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:25:32,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:25:32,901 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:25:32,901 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-28 21:25:32,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:25:32 BoogieIcfgContainer [2019-11-28 21:25:32,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:25:32,903 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:25:32,903 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:25:32,907 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:25:32,908 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:32,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:25:31" (1/3) ... [2019-11-28 21:25:32,909 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a66dcdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:25:32, skipping insertion in model container [2019-11-28 21:25:32,910 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:32,910 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (2/3) ... [2019-11-28 21:25:32,910 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a66dcdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:25:32, skipping insertion in model container [2019-11-28 21:25:32,910 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:32,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:25:32" (3/3) ... [2019-11-28 21:25:32,913 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrpbrk-alloca-2.i [2019-11-28 21:25:32,954 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:25:32,955 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:25:32,955 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:25:32,955 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:25:32,955 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:25:32,955 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:25:32,955 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:25:32,956 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:25:32,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-28 21:25:32,991 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-28 21:25:32,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:32,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:33,000 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:25:33,000 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:33,000 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:25:33,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-28 21:25:33,003 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-28 21:25:33,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:33,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:33,003 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:25:33,004 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:33,012 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#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.base, main_#t~ret18.offset, 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; 14#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 9#L535-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; 25#L541-3true [2019-11-28 21:25:33,012 INFO L796 eck$LassoCheckResult]: Loop: 25#L541-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; 22#L541-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 25#L541-3true [2019-11-28 21:25:33,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:33,019 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-28 21:25:33,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:33,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477843097] [2019-11-28 21:25:33,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:33,159 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:33,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-28 21:25:33,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:33,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605353378] [2019-11-28 21:25:33,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:33,182 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:33,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-28 21:25:33,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:33,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948173787] [2019-11-28 21:25:33,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:33,258 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:33,521 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-28 21:25:33,630 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:33,631 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:33,631 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:33,631 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:33,632 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:33,632 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:33,632 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:33,632 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:33,633 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration1_Lasso [2019-11-28 21:25:33,633 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:33,633 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:33,671 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:25:33,677 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:25:33,681 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:25:33,685 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:25:33,690 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:25:33,696 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:25:33,700 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:25:33,851 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-28 21:25:33,888 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:25:33,893 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:25:33,897 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:25:33,905 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:25:33,909 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:25:33,912 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:25:33,916 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:25:33,921 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:25:33,925 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:25:34,287 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:34,294 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:25:34,304 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:25:34,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:34,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:34,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:34,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:34,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:34,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:34,312 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:25:34,316 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:25:34,331 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:25:34,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:34,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:34,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:34,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:34,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:34,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:34,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:34,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 3 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:34,361 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:25:34,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:34,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:34,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:34,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:34,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:34,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:34,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:34,381 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:25:34,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:34,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:34,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:34,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:34,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:34,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:34,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:34,402 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:25:34,406 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:25:34,420 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:25:34,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:34,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:34,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:34,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:34,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:34,428 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:25:34,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:34,446 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:25:34,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:34,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:34,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:34,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:34,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:34,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:34,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:34,470 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:25:34,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:34,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:34,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:34,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:34,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:34,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:34,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:34,503 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:25:34,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:34,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:34,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:34,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:34,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:34,510 INFO L402 nArgumentSynthesizer]: A total of 2 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:25:34,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:34,530 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:25:34,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:34,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:34,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:34,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:34,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:34,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:34,534 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:25:34,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:34,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:34,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:34,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:34,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:34,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:34,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:34,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:34,581 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:34,605 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-28 21:25:34,606 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:34,655 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:25:34,678 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:34,679 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:34,680 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-28 21:25:34,707 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 21:25:34,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:34,816 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:25:34,818 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:34,843 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:25:34,844 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:34,857 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:25:34,875 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:25:34,876 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-11-28 21:25:34,953 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 60 states and 87 transitions. Complement of second has 7 states. [2019-11-28 21:25:34,954 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:25:34,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:25:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2019-11-28 21:25:34,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 21:25:34,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:34,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 21:25:34,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:34,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 21:25:34,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:34,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2019-11-28 21:25:34,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 21:25:34,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2019-11-28 21:25:34,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 21:25:34,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 21:25:34,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-28 21:25:34,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:34,977 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-28 21:25:34,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-28 21:25:35,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 21:25:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 21:25:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-11-28 21:25:35,010 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-28 21:25:35,010 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-28 21:25:35,010 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:25:35,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-11-28 21:25:35,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 21:25:35,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:35,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:35,012 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:35,013 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:35,013 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 167#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.base, main_#t~ret18.offset, 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; 168#L532 assume !(main_~length1~0 < 1); 169#L532-2 assume !(main_~length2~0 < 1); 163#L535-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; 164#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 160#L541-4 main_~i~1 := 0; 161#L546-3 [2019-11-28 21:25:35,013 INFO L796 eck$LassoCheckResult]: Loop: 161#L546-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; 165#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 161#L546-3 [2019-11-28 21:25:35,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:35,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-28 21:25:35,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:35,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474554077] [2019-11-28 21:25:35,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:35,042 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:35,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-28 21:25:35,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:35,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692304577] [2019-11-28 21:25:35,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:35,058 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:35,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:35,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-11-28 21:25:35,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:35,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978796378] [2019-11-28 21:25:35,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:35,115 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:35,348 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-28 21:25:35,415 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:35,416 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:35,416 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:35,416 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:35,416 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:35,416 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,417 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:35,417 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:35,417 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration2_Lasso [2019-11-28 21:25:35,417 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:35,417 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:35,421 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:25:35,430 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:25:35,432 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:25:35,434 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:25:35,436 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:25:35,439 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:25:35,441 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:25:35,447 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:25:35,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:25:35,452 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:25:35,455 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:25:35,628 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-28 21:25:35,648 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:25:35,651 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:25:35,654 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:25:35,656 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:25:35,924 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:35,925 INFO L489 LassoAnalysis]: Using template 'affine'. 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:25:35,940 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:25:35,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:35,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:35,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,950 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:25:35,967 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:25:35,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:35,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:35,972 INFO L402 nArgumentSynthesizer]: A total of 0 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:25:35,974 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,990 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:25:35,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:35,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:35,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:35,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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:36,012 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:25:36,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:36,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:36,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:36,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:36,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:36,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:36,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:36,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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:36,034 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:25:36,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:36,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:36,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:36,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:36,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:36,045 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:25:36,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:36,072 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:25:36,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:36,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:36,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:36,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:36,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:36,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:36,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:36,080 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 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:36,099 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:25:36,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:36,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:36,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:36,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:36,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:36,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:36,114 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) [2019-11-28 21:25:36,133 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:25:36,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:36,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:36,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:36,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:36,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:36,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:36,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 20 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:36,169 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:25:36,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:36,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:36,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:36,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:36,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:36,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:36,186 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) [2019-11-28 21:25:36,201 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:25:36,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:36,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:36,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:36,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:36,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:36,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:36,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:36,207 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:25:36,216 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:25:36,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:36,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:36,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:36,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:36,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:36,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:36,231 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:25:36,241 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:25:36,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:36,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:36,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:36,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:36,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:36,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:36,265 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:36,298 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-28 21:25:36,298 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:36,304 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:25:36,307 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:36,308 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:36,308 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:25:36,328 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 21:25:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:36,358 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:25:36,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:36,369 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:25:36,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:36,388 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:25:36,389 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:25:36,389 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 21:25:36,424 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 44 transitions. Complement of second has 6 states. [2019-11-28 21:25:36,424 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:25:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:25:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-11-28 21:25:36,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 21:25:36,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:36,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-28 21:25:36,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:36,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-28 21:25:36,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:36,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2019-11-28 21:25:36,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 21:25:36,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2019-11-28 21:25:36,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 21:25:36,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 21:25:36,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2019-11-28 21:25:36,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:36,432 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-28 21:25:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2019-11-28 21:25:36,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 21:25:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 21:25:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2019-11-28 21:25:36,435 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-28 21:25:36,435 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-28 21:25:36,435 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:25:36,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2019-11-28 21:25:36,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 21:25:36,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:36,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:36,437 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:36,438 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:36,438 INFO L794 eck$LassoCheckResult]: Stem: 298#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 293#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.base, main_#t~ret18.offset, 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; 294#L532 assume !(main_~length1~0 < 1); 295#L532-2 assume !(main_~length2~0 < 1); 288#L535-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; 289#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 285#L541-4 main_~i~1 := 0; 286#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 292#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 284#L519-4 [2019-11-28 21:25:36,439 INFO L796 eck$LassoCheckResult]: Loop: 284#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 287#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 299#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 296#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 297#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 281#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 282#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 283#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 284#L519-4 [2019-11-28 21:25:36,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:36,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-11-28 21:25:36,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:36,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175771281] [2019-11-28 21:25:36,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:36,487 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:36,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2019-11-28 21:25:36,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:36,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442340642] [2019-11-28 21:25:36,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:36,540 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:36,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:36,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2019-11-28 21:25:36,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:36,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658565793] [2019-11-28 21:25:36,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:36,802 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:25:36,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658565793] [2019-11-28 21:25:36,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:36,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 21:25:36,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604367245] [2019-11-28 21:25:36,970 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-28 21:25:37,216 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-28 21:25:37,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:37,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 21:25:37,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 21:25:37,228 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand 10 states. [2019-11-28 21:25:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:37,551 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2019-11-28 21:25:37,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 21:25:37,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2019-11-28 21:25:37,553 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-28 21:25:37,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 64 transitions. [2019-11-28 21:25:37,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-28 21:25:37,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-11-28 21:25:37,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2019-11-28 21:25:37,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:37,557 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-11-28 21:25:37,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2019-11-28 21:25:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2019-11-28 21:25:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 21:25:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2019-11-28 21:25:37,562 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-11-28 21:25:37,562 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-11-28 21:25:37,562 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:25:37,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2019-11-28 21:25:37,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-28 21:25:37,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:37,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:37,564 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:37,564 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:25:37,564 INFO L794 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 396#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.base, main_#t~ret18.offset, 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; 397#L532 assume !(main_~length1~0 < 1); 398#L532-2 assume !(main_~length2~0 < 1); 390#L535-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; 391#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 408#L541-4 main_~i~1 := 0; 394#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 395#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 412#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 411#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 404#L522-5 [2019-11-28 21:25:37,564 INFO L796 eck$LassoCheckResult]: Loop: 404#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 409#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 403#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 404#L522-5 [2019-11-28 21:25:37,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:37,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759941, now seen corresponding path program 1 times [2019-11-28 21:25:37,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:37,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146594294] [2019-11-28 21:25:37,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:37,664 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:25:37,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146594294] [2019-11-28 21:25:37,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:37,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 21:25:37,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743327728] [2019-11-28 21:25:37,665 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:37,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:37,666 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2019-11-28 21:25:37,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:37,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319933639] [2019-11-28 21:25:37,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:37,678 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:37,884 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-28 21:25:37,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:37,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 21:25:37,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 21:25:37,886 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand 7 states. [2019-11-28 21:25:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:37,976 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-28 21:25:37,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 21:25:37,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-11-28 21:25:37,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 21:25:37,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 29 transitions. [2019-11-28 21:25:37,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 21:25:37,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 21:25:37,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2019-11-28 21:25:37,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:37,979 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-11-28 21:25:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2019-11-28 21:25:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-28 21:25:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 21:25:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-11-28 21:25:37,981 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-28 21:25:37,981 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-28 21:25:37,981 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:25:37,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-11-28 21:25:37,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 21:25:37,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:37,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:37,983 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:37,983 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:37,983 INFO L794 eck$LassoCheckResult]: Stem: 475#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 470#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.base, main_#t~ret18.offset, 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; 471#L532 assume !(main_~length1~0 < 1); 472#L532-2 assume !(main_~length2~0 < 1); 465#L535-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; 466#L541-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; 477#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 478#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 462#L541-4 main_~i~1 := 0; 463#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 469#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 461#L519-4 [2019-11-28 21:25:37,983 INFO L796 eck$LassoCheckResult]: Loop: 461#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 464#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 476#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 473#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 474#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 458#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 459#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 460#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 461#L519-4 [2019-11-28 21:25:37,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:37,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-28 21:25:37,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:37,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042734174] [2019-11-28 21:25:37,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:38,027 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:38,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:38,029 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 2 times [2019-11-28 21:25:38,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:38,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960238855] [2019-11-28 21:25:38,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:38,066 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:38,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:38,071 INFO L82 PathProgramCache]: Analyzing trace with hash -164170776, now seen corresponding path program 1 times [2019-11-28 21:25:38,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:38,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209643487] [2019-11-28 21:25:38,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:38,277 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:25:38,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209643487] [2019-11-28 21:25:38,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:38,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 21:25:38,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392057933] [2019-11-28 21:25:38,413 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-28 21:25:38,649 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-28 21:25:38,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 21:25:38,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-28 21:25:38,652 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 10 states. [2019-11-28 21:25:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:38,874 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2019-11-28 21:25:38,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 21:25:38,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2019-11-28 21:25:38,875 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-28 21:25:38,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 44 transitions. [2019-11-28 21:25:38,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-28 21:25:38,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-28 21:25:38,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2019-11-28 21:25:38,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:38,877 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-28 21:25:38,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2019-11-28 21:25:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-28 21:25:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 21:25:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-11-28 21:25:38,881 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 21:25:38,881 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 21:25:38,881 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 21:25:38,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-11-28 21:25:38,882 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-28 21:25:38,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:38,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:38,882 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:38,882 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:38,883 INFO L794 eck$LassoCheckResult]: Stem: 560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 555#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.base, main_#t~ret18.offset, 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; 556#L532 assume !(main_~length1~0 < 1); 557#L532-2 assume !(main_~length2~0 < 1); 549#L535-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; 550#L541-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; 565#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 566#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 544#L541-4 main_~i~1 := 0; 545#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 553#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 546#L519-4 [2019-11-28 21:25:38,883 INFO L796 eck$LassoCheckResult]: Loop: 546#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 547#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 568#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 567#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 561#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 562#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 558#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 559#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 540#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 541#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 548#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 546#L519-4 [2019-11-28 21:25:38,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:38,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2019-11-28 21:25:38,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:38,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879989616] [2019-11-28 21:25:38,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:38,903 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:38,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:38,904 INFO L82 PathProgramCache]: Analyzing trace with hash -898285594, now seen corresponding path program 1 times [2019-11-28 21:25:38,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:38,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093585444] [2019-11-28 21:25:38,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:38,919 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:38,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:38,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1809250353, now seen corresponding path program 1 times [2019-11-28 21:25:38,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:38,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531385028] [2019-11-28 21:25:38,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 21:25:39,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531385028] [2019-11-28 21:25:39,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25101590] [2019-11-28 21:25:39,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:25:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:39,078 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 21:25:39,080 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:39,123 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:39,123 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:25:39,124 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:39,140 INFO L614 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-28 21:25:39,141 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:25:39,144 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:5 [2019-11-28 21:25:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 21:25:39,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 21:25:39,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2019-11-28 21:25:39,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042279473] [2019-11-28 21:25:39,465 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-11-28 21:25:39,764 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-28 21:25:39,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:39,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 21:25:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-11-28 21:25:39,766 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 9 states. [2019-11-28 21:25:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:39,961 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2019-11-28 21:25:39,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 21:25:39,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2019-11-28 21:25:39,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 21:25:39,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 28 transitions. [2019-11-28 21:25:39,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 21:25:39,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 21:25:39,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2019-11-28 21:25:39,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:39,965 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-28 21:25:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2019-11-28 21:25:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-28 21:25:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 21:25:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-11-28 21:25:39,969 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-28 21:25:39,969 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-28 21:25:39,969 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 21:25:39,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2019-11-28 21:25:39,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 21:25:39,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:39,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:39,970 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:39,970 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:39,970 INFO L794 eck$LassoCheckResult]: Stem: 712#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 707#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.base, main_#t~ret18.offset, 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; 708#L532 assume !(main_~length1~0 < 1); 709#L532-2 assume !(main_~length2~0 < 1); 702#L535-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; 703#L541-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; 714#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 715#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 699#L541-4 main_~i~1 := 0; 700#L546-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; 704#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 705#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 706#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 698#L519-4 [2019-11-28 21:25:39,971 INFO L796 eck$LassoCheckResult]: Loop: 698#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 701#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 713#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 710#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 711#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 695#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 696#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 697#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 698#L519-4 [2019-11-28 21:25:39,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:39,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-28 21:25:39,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:39,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846575466] [2019-11-28 21:25:39,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:39,993 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:39,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:39,993 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 3 times [2019-11-28 21:25:39,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:39,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747432386] [2019-11-28 21:25:39,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:40,004 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:40,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1875279350, now seen corresponding path program 1 times [2019-11-28 21:25:40,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:40,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416510694] [2019-11-28 21:25:40,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:40,034 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:40,207 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-28 21:25:40,426 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-28 21:25:40,874 WARN L192 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2019-11-28 21:25:41,055 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-28 21:25:41,058 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:41,059 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:41,059 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:41,059 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:41,059 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:41,059 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:41,059 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:41,059 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:41,059 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration7_Lasso [2019-11-28 21:25:41,059 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:41,060 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:41,065 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:25:41,076 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:25:41,077 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:25:41,079 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:25:41,080 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:25:41,082 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:25:41,084 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:25:41,087 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:25:41,088 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:25:41,090 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:25:41,092 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:25:41,095 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:25:41,097 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:25:41,098 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:25:41,103 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:25:41,105 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:25:41,106 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:25:41,108 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:25:41,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:25:41,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:25:41,115 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:25:41,120 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:25:41,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:25:41,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:25:41,123 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:25:41,589 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-11-28 21:25:41,830 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-11-28 21:25:41,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:25:41,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:25:42,467 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-11-28 21:25:42,641 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:42,642 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,647 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:25:42,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,652 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:25:42,662 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:25:42,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,667 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:25:42,672 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:25:42,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,675 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:25:42,681 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:25:42,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,684 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:25:42,702 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:25:42,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,706 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) [2019-11-28 21:25:42,720 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:25:42,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,730 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:25:42,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,734 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:25:42,739 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:25:42,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:42,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:42,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:42,773 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:25:42,779 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:25:42,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:42,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,787 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:25:42,798 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:25:42,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,815 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:25:42,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:42,829 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,833 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:25:42,838 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:25:42,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:42,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:42,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,856 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:25:42,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,864 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:25:42,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,873 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:25:42,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:42,889 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:25:42,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,894 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:42,902 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:25:42,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,906 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:42,913 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:25:42,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:42,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:42,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,926 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:25:42,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,935 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:25:42,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,944 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:25:42,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,952 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:25:42,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:42,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,967 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:25:42,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:42,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:42,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:43,002 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:25:43,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:43,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:43,004 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 21:25:43,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:43,012 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-28 21:25:43,013 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-28 21:25:43,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:43,047 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:25:43,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:43,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:43,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:43,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:43,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:43,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:43,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:43,069 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:25:43,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:43,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:43,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:43,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:43,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:43,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:43,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:43,085 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:25:43,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:43,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:43,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:43,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:43,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:43,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:43,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:43,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:43,098 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:25:43,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:43,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:43,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:43,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:43,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:43,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:43,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:43,113 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:43,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:43,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:43,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:43,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:43,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:43,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:43,162 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:43,228 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-28 21:25:43,228 INFO L444 ModelExtractionUtils]: 25 out of 55 variables were initially zero. Simplification set additionally 27 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:43,235 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:25:43,240 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:43,241 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:43,241 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_3) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_3 Supporting invariants [] [2019-11-28 21:25:43,305 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-11-28 21:25:43,308 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:25:43,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:43,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:25:43,361 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:43,384 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:25:43,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:43,405 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:25:43,405 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:25:43,405 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 21:25:43,459 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 29 states and 38 transitions. Complement of second has 5 states. [2019-11-28 21:25:43,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 21:25:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-11-28 21:25:43,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-28 21:25:43,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:43,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 8 letters. [2019-11-28 21:25:43,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:43,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 16 letters. [2019-11-28 21:25:43,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:43,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-11-28 21:25:43,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:43,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2019-11-28 21:25:43,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 21:25:43,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 21:25:43,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2019-11-28 21:25:43,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:25:43,463 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-28 21:25:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2019-11-28 21:25:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 21:25:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 21:25:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-28 21:25:43,466 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-28 21:25:43,466 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-28 21:25:43,466 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 21:25:43,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-11-28 21:25:43,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:43,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:43,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:43,467 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:43,467 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:25:43,467 INFO L794 eck$LassoCheckResult]: Stem: 917#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 910#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.base, main_#t~ret18.offset, 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; 911#L532 assume !(main_~length1~0 < 1); 912#L532-2 assume !(main_~length2~0 < 1); 905#L535-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; 906#L541-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; 920#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 921#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 900#L541-4 main_~i~1 := 0; 901#L546-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; 907#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 908#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 909#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 902#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 903#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 918#L522-5 [2019-11-28 21:25:43,467 INFO L796 eck$LassoCheckResult]: Loop: 918#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 913#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 914#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 918#L522-5 [2019-11-28 21:25:43,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:43,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2019-11-28 21:25:43,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:43,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827679321] [2019-11-28 21:25:43,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:43,489 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:43,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:43,490 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 2 times [2019-11-28 21:25:43,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:43,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759733966] [2019-11-28 21:25:43,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:43,497 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:43,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:43,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2019-11-28 21:25:43,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:43,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530747231] [2019-11-28 21:25:43,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:43,523 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:44,291 WARN L192 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 126 [2019-11-28 21:25:44,522 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-28 21:25:44,525 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:44,526 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:44,526 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:44,526 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:44,526 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:44,526 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:44,526 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:44,527 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:44,527 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration8_Lasso [2019-11-28 21:25:44,527 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:44,527 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:44,531 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:25:44,537 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:25:44,539 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:25:44,540 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:25:44,542 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:25:44,543 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:25:44,565 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:25:44,569 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:25:44,570 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:25:44,572 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:25:44,573 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:25:44,575 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:25:44,577 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:25:44,578 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:25:44,581 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:25:45,112 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-11-28 21:25:45,283 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-28 21:25:45,284 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:25:45,286 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:25:45,292 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:25:45,294 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:25:45,295 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:25:45,297 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:25:45,298 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:25:45,300 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:25:45,302 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:25:45,305 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:25:45,307 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:25:45,309 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:25:45,569 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-28 21:25:46,367 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-11-28 21:25:46,409 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:46,410 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,414 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:25:46,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:46,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:46,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:46,418 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,424 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:25:46,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:46,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:46,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:46,428 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,435 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:25:46,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:46,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:46,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:46,438 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,444 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:25:46,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:46,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:46,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:46,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:46,457 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:46,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:46,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:46,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:46,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:46,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:46,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:46,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:46,477 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:46,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:46,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,500 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:25:46,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:46,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:46,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:46,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,509 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:25:46,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:46,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:46,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:46,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,519 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:25:46,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:46,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:46,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:46,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,528 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:25:46,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:46,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:46,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,543 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:25:46,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:46,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:46,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:46,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:46,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:46,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:46,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:46,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,559 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:25:46,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:46,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:46,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,570 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:25:46,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:46,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:46,575 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:46,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:46,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:46,587 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 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,591 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:25:46,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:46,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:46,596 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 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,601 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:25:46,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:46,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:46,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:46,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:46,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:46,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:46,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:46,702 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2019-11-28 21:25:46,703 INFO L444 ModelExtractionUtils]: 9 out of 58 variables were initially zero. Simplification set additionally 46 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,707 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:25:46,709 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:46,709 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:46,710 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_4) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_4 Supporting invariants [] [2019-11-28 21:25:46,826 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-28 21:25:46,829 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:25:46,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:46,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:25:46,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:46,922 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:25:46,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:46,936 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:25:46,936 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-28 21:25:46,937 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 21:25:47,009 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 51 states and 67 transitions. Complement of second has 7 states. [2019-11-28 21:25:47,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 21:25:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-11-28 21:25:47,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-28 21:25:47,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:47,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-28 21:25:47,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:47,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-28 21:25:47,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:47,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 67 transitions. [2019-11-28 21:25:47,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:47,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 38 states and 50 transitions. [2019-11-28 21:25:47,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 21:25:47,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 21:25:47,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 50 transitions. [2019-11-28 21:25:47,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:25:47,014 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-11-28 21:25:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 50 transitions. [2019-11-28 21:25:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-11-28 21:25:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 21:25:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-28 21:25:47,017 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-28 21:25:47,017 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-28 21:25:47,017 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 21:25:47,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-11-28 21:25:47,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:47,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:47,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:47,019 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:47,019 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:25:47,019 INFO L794 eck$LassoCheckResult]: Stem: 1178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1171#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.base, main_#t~ret18.offset, 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; 1172#L532 assume !(main_~length1~0 < 1); 1173#L532-2 assume !(main_~length2~0 < 1); 1166#L535-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; 1167#L541-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; 1181#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1182#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1160#L541-4 main_~i~1 := 0; 1161#L546-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; 1168#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1169#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1170#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 1162#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1163#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1185#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1176#L522-1 assume !cstrpbrk_#t~short7; 1177#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 1158#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 1159#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 1156#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 1157#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1164#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1179#L522-5 [2019-11-28 21:25:47,019 INFO L796 eck$LassoCheckResult]: Loop: 1179#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1174#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1175#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 1179#L522-5 [2019-11-28 21:25:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:47,020 INFO L82 PathProgramCache]: Analyzing trace with hash -777149455, now seen corresponding path program 1 times [2019-11-28 21:25:47,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:47,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464517168] [2019-11-28 21:25:47,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 21:25:47,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464517168] [2019-11-28 21:25:47,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:47,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 21:25:47,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8205050] [2019-11-28 21:25:47,081 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:47,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:47,081 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 3 times [2019-11-28 21:25:47,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:47,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724949414] [2019-11-28 21:25:47,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:47,089 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:47,273 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-28 21:25:47,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:47,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 21:25:47,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 21:25:47,274 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-11-28 21:25:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:47,384 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-11-28 21:25:47,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 21:25:47,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. [2019-11-28 21:25:47,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 21:25:47,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 35 states and 45 transitions. [2019-11-28 21:25:47,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 21:25:47,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 21:25:47,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2019-11-28 21:25:47,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:25:47,387 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-28 21:25:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2019-11-28 21:25:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-28 21:25:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 21:25:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-11-28 21:25:47,390 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 21:25:47,390 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 21:25:47,390 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 21:25:47,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-11-28 21:25:47,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:47,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:47,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:47,391 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:47,392 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:25:47,392 INFO L794 eck$LassoCheckResult]: Stem: 1266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1259#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.base, main_#t~ret18.offset, 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; 1260#L532 assume !(main_~length1~0 < 1); 1261#L532-2 assume !(main_~length2~0 < 1); 1254#L535-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; 1255#L541-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; 1270#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1271#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1248#L541-4 main_~i~1 := 0; 1249#L546-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; 1256#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1257#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1258#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 1250#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1251#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1275#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1276#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1273#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 1244#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 1245#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 1246#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 1247#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1252#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1267#L522-5 [2019-11-28 21:25:47,392 INFO L796 eck$LassoCheckResult]: Loop: 1267#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1262#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1263#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 1267#L522-5 [2019-11-28 21:25:47,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:47,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1742810479, now seen corresponding path program 2 times [2019-11-28 21:25:47,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:47,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408506640] [2019-11-28 21:25:47,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 21:25:47,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408506640] [2019-11-28 21:25:47,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723555495] [2019-11-28 21:25:47,662 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:25:47,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 21:25:47,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:25:47,739 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-28 21:25:47,741 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:47,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:47,761 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:25:47,762 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:47,798 INFO L614 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-11-28 21:25:47,798 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:25:47,799 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:24 [2019-11-28 21:25:48,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:25:48,246 INFO L343 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2019-11-28 21:25:48,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 23 [2019-11-28 21:25:48,247 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:48,272 INFO L343 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2019-11-28 21:25:48,272 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 21 [2019-11-28 21:25:48,273 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:48,304 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:48,305 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-28 21:25:48,305 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:79 [2019-11-28 21:25:48,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:48,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2019-11-28 21:25:48,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:25:48,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:25:48,437 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 21:25:48,484 INFO L614 ElimStorePlain]: treesize reduction 8, result has 82.6 percent of original size [2019-11-28 21:25:48,488 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 21:25:48,489 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 21:25:48,504 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-28 21:25:48,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 21:25:48,505 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:48,525 INFO L614 ElimStorePlain]: treesize reduction 8, result has 66.7 percent of original size [2019-11-28 21:25:48,526 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:25:48,527 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:3 [2019-11-28 21:25:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:48,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:25:48,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2019-11-28 21:25:48,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729617535] [2019-11-28 21:25:48,556 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:48,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:48,556 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 4 times [2019-11-28 21:25:48,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:48,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782039817] [2019-11-28 21:25:48,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:48,568 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:48,758 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-28 21:25:48,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:48,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 21:25:48,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-11-28 21:25:48,760 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 15 Second operand 19 states. [2019-11-28 21:25:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:50,080 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2019-11-28 21:25:50,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 21:25:50,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 86 transitions. [2019-11-28 21:25:50,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:50,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 36 states and 46 transitions. [2019-11-28 21:25:50,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 21:25:50,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 21:25:50,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2019-11-28 21:25:50,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:25:50,084 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-11-28 21:25:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2019-11-28 21:25:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-11-28 21:25:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 21:25:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2019-11-28 21:25:50,086 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-28 21:25:50,086 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-28 21:25:50,086 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 21:25:50,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2019-11-28 21:25:50,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:50,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:50,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:50,088 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:50,088 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:25:50,089 INFO L794 eck$LassoCheckResult]: Stem: 1486#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1479#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.base, main_#t~ret18.offset, 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; 1480#L532 assume !(main_~length1~0 < 1); 1481#L532-2 assume !(main_~length2~0 < 1); 1474#L535-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; 1475#L541-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; 1490#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1491#L541-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; 1493#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1494#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1468#L541-4 main_~i~1 := 0; 1469#L546-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; 1476#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1477#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1478#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 1470#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1471#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1489#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1484#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1485#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 1464#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 1465#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 1466#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 1467#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1472#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1487#L522-5 [2019-11-28 21:25:50,089 INFO L796 eck$LassoCheckResult]: Loop: 1487#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1482#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1483#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 1487#L522-5 [2019-11-28 21:25:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:50,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1365761455, now seen corresponding path program 3 times [2019-11-28 21:25:50,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:50,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975371213] [2019-11-28 21:25:50,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:50,118 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:50,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:50,118 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 5 times [2019-11-28 21:25:50,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:50,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886168592] [2019-11-28 21:25:50,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:50,125 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:50,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:50,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1174254192, now seen corresponding path program 1 times [2019-11-28 21:25:50,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:50,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404602820] [2019-11-28 21:25:50,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:50,169 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:52,015 WARN L192 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 228 DAG size of output: 181 [2019-11-28 21:25:54,990 WARN L192 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 142 DAG size of output: 142 [2019-11-28 21:25:54,994 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:54,994 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:54,994 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:54,994 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:54,995 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:54,995 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:54,995 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:54,995 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:54,995 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration11_Lasso [2019-11-28 21:25:54,995 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:54,995 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:55,004 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:25:55,010 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:25:55,012 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:25:55,014 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:25:55,016 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:25:55,017 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:25:55,020 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:25:55,021 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:25:55,023 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:25:55,025 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:25:55,027 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:25:55,029 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:25:55,031 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:25:55,382 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-28 21:25:56,725 WARN L192 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 140 DAG size of output: 116 [2019-11-28 21:25:56,920 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-28 21:25:56,921 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:25:56,923 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:25:56,924 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:25:56,925 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:25:56,927 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:25:56,930 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:25:56,938 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:25:56,939 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:25:56,940 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:25:56,941 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:25:56,944 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:25:56,945 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:25:56,947 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:25:56,952 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:25:56,954 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:25:57,352 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-11-28 21:25:57,569 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-28 21:25:57,890 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-28 21:25:58,361 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-11-28 21:25:58,577 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-28 21:25:58,637 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:58,637 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,642 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:25:58,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:58,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:58,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:58,654 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 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,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:25:58,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:58,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:58,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:58,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 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,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:25:58,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:58,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:58,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:58,672 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:58,677 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:58,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:58,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:58,681 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 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,686 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:25:58,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:58,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:58,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:58,689 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 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,695 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:25:58,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:58,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:58,702 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 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,707 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:25:58,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:58,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:58,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:58,712 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 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,718 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:25:58,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:58,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:58,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:58,721 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 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,729 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:25:58,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:58,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:58,736 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 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,741 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:25:58,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:58,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:58,747 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:58,753 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:25:58,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:58,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:58,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,758 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 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,763 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:25:58,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:58,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:58,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:58,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 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,772 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:25:58,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:58,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:58,806 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:58,820 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:58,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:58,831 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 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,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:25:58,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:58,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:58,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:58,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:58,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:58,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:58,876 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:58,949 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2019-11-28 21:25:58,949 INFO L444 ModelExtractionUtils]: 10 out of 64 variables were initially zero. Simplification set additionally 51 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:58,955 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:58,957 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:58,958 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:58,958 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_5) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_5 Supporting invariants [] [2019-11-28 21:25:59,148 INFO L297 tatePredicateManager]: 32 out of 34 supporting invariants were superfluous and have been removed [2019-11-28 21:25:59,152 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:25:59,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:59,207 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:25:59,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:59,238 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:25:59,238 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:59,254 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:25:59,254 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-28 21:25:59,254 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-28 21:25:59,331 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 51 states and 63 transitions. Complement of second has 7 states. [2019-11-28 21:25:59,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 21:25:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-11-28 21:25:59,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 21:25:59,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:59,332 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:25:59,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:59,384 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:25:59,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:59,422 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:25:59,422 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:59,436 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:25:59,437 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-28 21:25:59,437 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-28 21:25:59,513 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 51 states and 63 transitions. Complement of second has 7 states. [2019-11-28 21:25:59,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 21:25:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-11-28 21:25:59,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 21:25:59,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:59,514 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:25:59,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:59,566 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:25:59,567 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:59,597 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:25:59,598 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:59,612 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:25:59,613 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-28 21:25:59,613 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-28 21:25:59,688 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 51 states and 65 transitions. Complement of second has 6 states. [2019-11-28 21:25:59,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 21:25:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2019-11-28 21:25:59,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 21:25:59,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:59,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-28 21:25:59,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:59,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-28 21:25:59,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:59,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2019-11-28 21:25:59,693 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:25:59,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 0 states and 0 transitions. [2019-11-28 21:25:59,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:25:59,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:25:59,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:25:59,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:59,694 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:59,694 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:59,694 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:59,694 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 21:25:59,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 21:25:59,695 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:25:59,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 21:25:59,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:25:59 BoogieIcfgContainer [2019-11-28 21:25:59,702 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:25:59,705 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:25:59,705 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:25:59,705 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:25:59,706 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:25:32" (3/4) ... [2019-11-28 21:25:59,710 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 21:25:59,711 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:25:59,712 INFO L168 Benchmark]: Toolchain (without parser) took 28036.41 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 483.4 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -84.9 MB). Peak memory consumption was 398.5 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:59,713 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:25:59,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 654.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:59,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.53 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:59,714 INFO L168 Benchmark]: Boogie Preprocessor took 36.50 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:25:59,714 INFO L168 Benchmark]: RCFGBuilder took 477.80 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.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:59,715 INFO L168 Benchmark]: BuchiAutomizer took 26798.56 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 340.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.2 MB). Peak memory consumption was 384.5 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:59,715 INFO L168 Benchmark]: Witness Printer took 5.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:25:59,717 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 654.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.53 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.50 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 477.80 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.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 26798.56 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 340.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.2 MB). Peak memory consumption was 384.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.7s and 12 iterations. TraceHistogramMax:2. Analysis of lassos took 23.0s. Construction of modules took 0.7s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 28 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 10. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 240 SDtfs, 725 SDslu, 608 SDs, 0 SdLazy, 657 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital413 mio100 ax107 hnf98 lsp82 ukn67 mio100 lsp44 div103 bol100 ite100 ukn100 eq179 hnf89 smp96 dnf317 smp60 tf100 neg98 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 46ms VariablesStem: 3 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...