./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_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/openbsd_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 b05f810cf5c3fdbb476cd22f2154f4cd5a41b63d ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 21:26:00,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:26:00,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:26:00,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:26:00,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:26:00,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:26:00,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:26:00,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:26:00,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:26:00,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:26:00,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:26:00,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:26:00,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:26:00,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:26:00,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:26:00,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:26:00,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:26:00,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:26:00,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:26:00,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:26:00,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:26:00,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:26:00,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:26:00,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:26:00,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:26:00,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:26:00,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:26:00,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:26:00,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:26:00,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:26:00,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:26:00,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:26:00,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:26:00,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:26:00,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:26:00,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:26:00,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:26:00,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:26:00,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:26:00,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:26:00,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:26:00,542 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:26:00,558 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:26:00,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:26:00,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:26:00,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:26:00,561 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:26:00,561 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:26:00,561 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:26:00,561 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:26:00,562 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:26:00,562 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:26:00,562 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:26:00,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:26:00,563 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:26:00,563 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:26:00,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:26:00,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:26:00,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:26:00,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:26:00,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:26:00,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:26:00,565 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:26:00,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:26:00,566 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:26:00,566 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:26:00,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:26:00,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:26:00,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:26:00,567 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:26:00,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:26:00,567 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:26:00,568 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:26:00,568 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:26:00,569 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:26:00,569 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 -> b05f810cf5c3fdbb476cd22f2154f4cd5a41b63d [2019-11-28 21:26:00,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:26:00,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:26:00,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:26:00,891 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:26:00,891 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:26:00,892 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i [2019-11-28 21:26:00,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84065692c/1d39ce020d994deb94728dbb71b38c7e/FLAG62c229757 [2019-11-28 21:26:01,524 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:26:01,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i [2019-11-28 21:26:01,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84065692c/1d39ce020d994deb94728dbb71b38c7e/FLAG62c229757 [2019-11-28 21:26:01,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84065692c/1d39ce020d994deb94728dbb71b38c7e [2019-11-28 21:26:01,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:26:01,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:26:01,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:26:01,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:26:01,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:26:01,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:26:01" (1/1) ... [2019-11-28 21:26:01,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513813e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:01, skipping insertion in model container [2019-11-28 21:26:01,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:26:01" (1/1) ... [2019-11-28 21:26:01,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:26:01,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:26:02,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:26:02,306 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:26:02,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:26:02,408 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:26:02,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:02 WrapperNode [2019-11-28 21:26:02,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:26:02,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:26:02,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:26:02,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:26:02,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:02" (1/1) ... [2019-11-28 21:26:02,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:02" (1/1) ... [2019-11-28 21:26:02,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:26:02,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:26:02,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:26:02,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:26:02,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:02" (1/1) ... [2019-11-28 21:26:02,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:02" (1/1) ... [2019-11-28 21:26:02,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:02" (1/1) ... [2019-11-28 21:26:02,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:02" (1/1) ... [2019-11-28 21:26:02,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:02" (1/1) ... [2019-11-28 21:26:02,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:02" (1/1) ... [2019-11-28 21:26:02,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:02" (1/1) ... [2019-11-28 21:26:02,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:26:02,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:26:02,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:26:02,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:26:02,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 21:26:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 21:26:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:26:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 21:26:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:26:02,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:26:02,924 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:26:02,924 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-28 21:26:02,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:02 BoogieIcfgContainer [2019-11-28 21:26:02,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:26:02,926 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:26:02,927 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:26:02,930 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:26:02,931 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:02,931 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:26:01" (1/3) ... [2019-11-28 21:26:02,933 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7dd11c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:26:02, skipping insertion in model container [2019-11-28 21:26:02,933 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:02,933 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:02" (2/3) ... [2019-11-28 21:26:02,934 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7dd11c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:26:02, skipping insertion in model container [2019-11-28 21:26:02,934 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:02,934 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:02" (3/3) ... [2019-11-28 21:26:02,936 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca-2.i [2019-11-28 21:26:02,986 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:26:02,987 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:26:02,987 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:26:02,987 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:26:02,988 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:26:02,988 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:26:02,988 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:26:02,988 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:26:03,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 21:26:03,020 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 21:26:03,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:03,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:03,026 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:26:03,027 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:26:03,027 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:26:03,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 21:26:03,029 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 21:26:03,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:03,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:03,030 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:26:03,030 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:26:03,036 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 19#L528true assume !(main_~length1~0 < 1); 5#L528-2true assume !(main_~length2~0 < 1); 15#L531-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 9#L537-3true [2019-11-28 21:26:03,037 INFO L796 eck$LassoCheckResult]: Loop: 9#L537-3true assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 8#L537-2true main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 9#L537-3true [2019-11-28 21:26:03,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:03,042 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-28 21:26:03,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:03,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550602853] [2019-11-28 21:26:03,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:03,180 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-28 21:26:03,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:03,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286323257] [2019-11-28 21:26:03,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:03,201 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:03,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:03,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-28 21:26:03,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:03,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958611943] [2019-11-28 21:26:03,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:03,251 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:03,499 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-28 21:26:03,597 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:03,598 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:03,598 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:03,598 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:03,599 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:03,599 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:03,599 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:03,599 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:03,600 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration1_Lasso [2019-11-28 21:26:03,600 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:03,600 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:03,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:03,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:03,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:03,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:03,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:03,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:26:03,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:03,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:03,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:03,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:03,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:03,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:03,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:03,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:03,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:03,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:04,227 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:04,233 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:04,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:04,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:04,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:04,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:04,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:04,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:04,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:04,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:04,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:04,354 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:26:04,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:04,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:04,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:04,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:04,384 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:04,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:04,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:04,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:04,405 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:26:04,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:26:04,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:04,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:04,426 INFO L402 nArgumentSynthesizer]: A total of 0 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:26:04,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:04,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:26:04,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:04,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:04,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:04,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:04,474 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:26:04,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:04,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:04,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:04,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:04,506 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:26:04,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:04,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:04,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 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:26:04,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:04,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:04,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:04,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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:04,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:04,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:04,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:04,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:04,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:04,594 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:26:04,604 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:26:04,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:04,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:04,626 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:26:04,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:04,643 INFO L402 nArgumentSynthesizer]: A total of 2 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:26:04,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:04,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:04,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:04,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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:04,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:04,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:04,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:04,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:04,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:04,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:04,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:04,723 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:04,826 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-28 21:26:04,826 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:04,893 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:26:04,897 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:26:04,897 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:04,898 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:26:04,923 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 21:26:04,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:04,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:26:04,978 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:04,992 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:26:04,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:05,028 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:26:05,030 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2019-11-28 21:26:05,094 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 51 states and 75 transitions. Complement of second has 7 states. [2019-11-28 21:26:05,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:26:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:26:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2019-11-28 21:26:05,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 21:26:05,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:05,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 21:26:05,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:05,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 21:26:05,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:05,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 75 transitions. [2019-11-28 21:26:05,107 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 21:26:05,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 23 transitions. [2019-11-28 21:26:05,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 21:26:05,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 21:26:05,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-11-28 21:26:05,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:05,116 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 21:26:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-11-28 21:26:05,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 21:26:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 21:26:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-28 21:26:05,149 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 21:26:05,149 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 21:26:05,149 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:26:05,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-28 21:26:05,150 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 21:26:05,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:05,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:05,151 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:05,151 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:26:05,151 INFO L794 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 157#L528 assume !(main_~length1~0 < 1); 148#L528-2 assume !(main_~length2~0 < 1); 149#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 153#L537-3 assume !(main_~i~0 < main_~length1~0); 154#L537-4 main_~i~1 := 0; 155#L541-3 [2019-11-28 21:26:05,152 INFO L796 eck$LassoCheckResult]: Loop: 155#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 160#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 155#L541-3 [2019-11-28 21:26:05,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:05,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-28 21:26:05,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:05,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101115064] [2019-11-28 21:26:05,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:05,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101115064] [2019-11-28 21:26:05,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:05,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:26:05,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243606200] [2019-11-28 21:26:05,233 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:26:05,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:05,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-28 21:26:05,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:05,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575589843] [2019-11-28 21:26:05,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:05,276 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:05,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:05,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:26:05,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:26:05,319 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 21:26:05,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:05,357 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-28 21:26:05,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:26:05,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-28 21:26:05,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 21:26:05,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2019-11-28 21:26:05,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 21:26:05,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 21:26:05,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-11-28 21:26:05,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:05,364 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-28 21:26:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-11-28 21:26:05,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 21:26:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 21:26:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-11-28 21:26:05,369 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-28 21:26:05,369 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-28 21:26:05,369 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:26:05,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2019-11-28 21:26:05,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 21:26:05,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:05,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:05,373 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:05,373 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:26:05,373 INFO L794 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 198#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 199#L528 assume !(main_~length1~0 < 1); 190#L528-2 assume !(main_~length2~0 < 1); 191#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 195#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 193#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 194#L537-3 assume !(main_~i~0 < main_~length1~0); 196#L537-4 main_~i~1 := 0; 197#L541-3 [2019-11-28 21:26:05,374 INFO L796 eck$LassoCheckResult]: Loop: 197#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 202#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 197#L541-3 [2019-11-28 21:26:05,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:05,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2019-11-28 21:26:05,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:05,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239737882] [2019-11-28 21:26:05,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:05,474 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:05,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:05,474 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2019-11-28 21:26:05,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:05,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414338440] [2019-11-28 21:26:05,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:05,485 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:05,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:05,486 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2019-11-28 21:26:05,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:05,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576258255] [2019-11-28 21:26:05,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:05,519 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:05,739 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-28 21:26:05,811 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:05,811 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:05,811 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:05,811 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:05,812 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:05,812 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:05,812 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:05,812 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:05,812 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration3_Lasso [2019-11-28 21:26:05,812 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:05,812 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:05,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:05,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:05,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:05,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:05,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:05,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:05,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:05,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:05,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:05,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:05,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:05,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:05,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:05,984 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-28 21:26:06,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:06,312 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:06,313 INFO L489 LassoAnalysis]: Using template 'affine'. 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:26:06,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:06,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:06,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:06,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:06,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:06,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:26:06,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:06,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:06,365 INFO L402 nArgumentSynthesizer]: A total of 0 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:26:06,367 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:26:06,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:06,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:06,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:06,379 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:26:06,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:06,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:06,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:06,396 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:26:06,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:06,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:06,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:06,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:06,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:06,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:06,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:06,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:06,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:06,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:06,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:06,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:06,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:06,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:06,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:06,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 [2019-11-28 21:26:06,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:06,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:06,466 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) [2019-11-28 21:26:06,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:06,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:06,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:06,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:06,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:06,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:06,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:06,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:06,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:06,489 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) [2019-11-28 21:26:06,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:06,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:06,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:06,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:06,501 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) [2019-11-28 21:26:06,507 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:06,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:06,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:06,515 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:26:06,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:06,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:06,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:06,525 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:26:06,527 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) [2019-11-28 21:26:06,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:06,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:06,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:06,545 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) [2019-11-28 21:26:06,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:06,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:06,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:06,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:06,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:06,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:06,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:06,585 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:06,630 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2019-11-28 21:26:06,631 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:06,636 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:06,639 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 21:26:06,640 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:06,640 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2) = -1*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2 Supporting invariants [1*ULTIMATE.start_main_~nondetString2~0.offset >= 0] [2019-11-28 21:26:06,666 INFO L297 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2019-11-28 21:26:06,671 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:26:06,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:06,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 21:26:06,726 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:06,751 WARN L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:26:06,751 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:06,771 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 21:26:06,771 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-28 21:26:06,823 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 25 states and 35 transitions. Complement of second has 7 states. [2019-11-28 21:26:06,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:26:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 21:26:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-11-28 21:26:06,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-28 21:26:06,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:06,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-28 21:26:06,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:06,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-28 21:26:06,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:06,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2019-11-28 21:26:06,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:26:06,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 24 transitions. [2019-11-28 21:26:06,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 21:26:06,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 21:26:06,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-11-28 21:26:06,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:06,830 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-28 21:26:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-11-28 21:26:06,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-28 21:26:06,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 21:26:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-11-28 21:26:06,833 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-28 21:26:06,833 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-28 21:26:06,833 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:26:06,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-11-28 21:26:06,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:26:06,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:06,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:06,834 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:06,834 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 21:26:06,835 INFO L794 eck$LassoCheckResult]: Stem: 337#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 335#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 336#L528 assume !(main_~length1~0 < 1); 327#L528-2 assume !(main_~length2~0 < 1); 328#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 332#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 330#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 331#L537-3 assume !(main_~i~0 < main_~length1~0); 333#L537-4 main_~i~1 := 0; 334#L541-3 assume !(main_~i~1 < main_~length2~0); 325#L541-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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 326#L519-4 [2019-11-28 21:26:06,835 INFO L796 eck$LassoCheckResult]: Loop: 326#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 329#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 323#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 324#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 326#L519-4 [2019-11-28 21:26:06,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:06,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-28 21:26:06,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:06,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776822454] [2019-11-28 21:26:06,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 21:26:06,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776822454] [2019-11-28 21:26:06,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:06,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:26:06,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670345381] [2019-11-28 21:26:06,887 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:26:06,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:06,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2406249, now seen corresponding path program 1 times [2019-11-28 21:26:06,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:06,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640924434] [2019-11-28 21:26:06,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:06,916 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:07,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:07,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:26:07,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:26:07,011 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 21:26:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:07,035 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-11-28 21:26:07,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:26:07,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-11-28 21:26:07,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:26:07,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 24 transitions. [2019-11-28 21:26:07,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 21:26:07,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 21:26:07,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2019-11-28 21:26:07,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:07,040 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 21:26:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2019-11-28 21:26:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-28 21:26:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 21:26:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-11-28 21:26:07,042 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-28 21:26:07,042 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-28 21:26:07,042 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:26:07,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-11-28 21:26:07,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:26:07,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:07,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:07,045 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:07,045 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 21:26:07,045 INFO L794 eck$LassoCheckResult]: Stem: 381#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 379#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 380#L528 assume !(main_~length1~0 < 1); 371#L528-2 assume !(main_~length2~0 < 1); 372#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 376#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 374#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 375#L537-3 assume !(main_~i~0 < main_~length1~0); 377#L537-4 main_~i~1 := 0; 378#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 383#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 384#L541-3 assume !(main_~i~1 < main_~length2~0); 369#L541-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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 370#L519-4 [2019-11-28 21:26:07,046 INFO L796 eck$LassoCheckResult]: Loop: 370#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 373#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 367#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 368#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 370#L519-4 [2019-11-28 21:26:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:07,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-28 21:26:07,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:07,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593330589] [2019-11-28 21:26:07,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:07,128 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:07,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:07,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2406249, now seen corresponding path program 2 times [2019-11-28 21:26:07,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:07,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756818760] [2019-11-28 21:26:07,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:07,147 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:07,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:07,150 INFO L82 PathProgramCache]: Analyzing trace with hash -796589374, now seen corresponding path program 1 times [2019-11-28 21:26:07,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:07,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266739060] [2019-11-28 21:26:07,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 21:26:07,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266739060] [2019-11-28 21:26:07,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303366100] [2019-11-28 21:26:07,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:26:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:07,479 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-28 21:26:07,483 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:07,614 INFO L343 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2019-11-28 21:26:07,615 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 33 treesize of output 19 [2019-11-28 21:26:07,615 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:26:07,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:26:07,628 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 1 xjuncts. [2019-11-28 21:26:07,628 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:31 [2019-11-28 21:26:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 21:26:07,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:26:07,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-28 21:26:07,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635478248] [2019-11-28 21:26:07,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:07,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 21:26:07,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-28 21:26:07,796 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand 13 states. [2019-11-28 21:26:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:08,128 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2019-11-28 21:26:08,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 21:26:08,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions. [2019-11-28 21:26:08,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:26:08,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 26 transitions. [2019-11-28 21:26:08,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 21:26:08,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 21:26:08,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2019-11-28 21:26:08,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:08,131 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-28 21:26:08,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2019-11-28 21:26:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-28 21:26:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 21:26:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-11-28 21:26:08,135 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-28 21:26:08,135 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-28 21:26:08,136 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 21:26:08,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-11-28 21:26:08,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:26:08,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:08,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:08,137 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:08,137 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 21:26:08,138 INFO L794 eck$LassoCheckResult]: Stem: 504#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 502#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 503#L528 assume !(main_~length1~0 < 1); 493#L528-2 assume !(main_~length2~0 < 1); 494#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 498#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 496#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 497#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 499#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 508#L537-3 assume !(main_~i~0 < main_~length1~0); 500#L537-4 main_~i~1 := 0; 501#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 506#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 507#L541-3 assume !(main_~i~1 < main_~length2~0); 491#L541-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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 492#L519-4 [2019-11-28 21:26:08,138 INFO L796 eck$LassoCheckResult]: Loop: 492#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 495#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 489#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 490#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 492#L519-4 [2019-11-28 21:26:08,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:08,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1523394364, now seen corresponding path program 2 times [2019-11-28 21:26:08,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:08,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30819630] [2019-11-28 21:26:08,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:08,172 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:08,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:08,173 INFO L82 PathProgramCache]: Analyzing trace with hash 2406249, now seen corresponding path program 3 times [2019-11-28 21:26:08,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:08,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521160880] [2019-11-28 21:26:08,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:08,183 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:08,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:08,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1430636836, now seen corresponding path program 2 times [2019-11-28 21:26:08,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:08,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259029204] [2019-11-28 21:26:08,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:08,221 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:09,010 WARN L192 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 119 [2019-11-28 21:26:09,222 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-28 21:26:09,229 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:09,229 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:09,229 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:09,229 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:09,230 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:09,230 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:09,230 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:09,230 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:09,230 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration6_Lasso [2019-11-28 21:26:09,230 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:09,231 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:09,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,679 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-11-28 21:26:09,846 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-28 21:26:09,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,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:26:09,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:09,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:10,474 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:10,475 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:10,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:10,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:10,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:10,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:10,484 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:26:10,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:10,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:10,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:10,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:10,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:10,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:10,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:10,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:10,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:10,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:10,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:10,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:10,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:10,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:10,510 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:26:10,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:10,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:10,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:10,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:10,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:26:10,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:10,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:10,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:10,533 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:26:10,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:10,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:10,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:10,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:10,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:10,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:10,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:10,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:10,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:10,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:10,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:10,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:10,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:10,582 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:10,628 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-28 21:26:10,628 INFO L444 ModelExtractionUtils]: 6 out of 28 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:10,633 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:26:10,637 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:26:10,637 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:10,637 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s1.offset, v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2 Supporting invariants [] [2019-11-28 21:26:10,690 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2019-11-28 21:26:10,693 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:26:10,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:10,744 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 21:26:10,745 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:10,755 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 21:26:10,756 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:10,777 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:26:10,777 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 21:26:10,804 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 26 states and 32 transitions. Complement of second has 4 states. [2019-11-28 21:26:10,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:26:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:26:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2019-11-28 21:26:10,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 21:26:10,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:10,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2019-11-28 21:26:10,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:10,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 15 letters. Loop has 8 letters. [2019-11-28 21:26:10,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:10,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2019-11-28 21:26:10,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:10,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 31 transitions. [2019-11-28 21:26:10,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 21:26:10,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 21:26:10,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2019-11-28 21:26:10,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:10,811 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-28 21:26:10,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2019-11-28 21:26:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-28 21:26:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 21:26:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-28 21:26:10,814 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-28 21:26:10,814 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-28 21:26:10,814 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 21:26:10,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2019-11-28 21:26:10,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:10,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:10,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:10,815 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:10,815 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:26:10,816 INFO L794 eck$LassoCheckResult]: Stem: 691#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 689#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 690#L528 assume !(main_~length1~0 < 1); 679#L528-2 assume !(main_~length2~0 < 1); 680#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 685#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 683#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 684#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 686#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 696#L537-3 assume !(main_~i~0 < main_~length1~0); 687#L537-4 main_~i~1 := 0; 688#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 694#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 695#L541-3 assume !(main_~i~1 < main_~length2~0); 677#L541-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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 678#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 681#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 673#L519-3 [2019-11-28 21:26:10,816 INFO L796 eck$LassoCheckResult]: Loop: 673#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 674#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 692#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 673#L519-3 [2019-11-28 21:26:10,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:10,816 INFO L82 PathProgramCache]: Analyzing trace with hash -601862591, now seen corresponding path program 1 times [2019-11-28 21:26:10,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:10,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494696209] [2019-11-28 21:26:10,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:10,881 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:10,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:10,882 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 1 times [2019-11-28 21:26:10,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:10,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188510895] [2019-11-28 21:26:10,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:10,889 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:10,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:10,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1400069085, now seen corresponding path program 1 times [2019-11-28 21:26:10,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:10,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358056623] [2019-11-28 21:26:10,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 21:26:11,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358056623] [2019-11-28 21:26:11,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229089] [2019-11-28 21:26:11,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:26:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:11,084 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 21:26:11,086 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:11,147 INFO L343 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-11-28 21:26:11,148 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 36 treesize of output 21 [2019-11-28 21:26:11,149 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:26:11,158 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:26:11,159 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 21:26:11,160 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:27 [2019-11-28 21:26:12,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 21:26:12,462 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:26:12,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:26:12,469 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:26:12,469 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-28 21:26:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 21:26:12,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:26:12,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-11-28 21:26:12,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025066343] [2019-11-28 21:26:12,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:12,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 21:26:12,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=139, Unknown=1, NotChecked=0, Total=182 [2019-11-28 21:26:12,523 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. cyclomatic complexity: 10 Second operand 14 states. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 21:26:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:12,841 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2019-11-28 21:26:12,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 21:26:12,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 62 transitions. [2019-11-28 21:26:12,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:12,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 30 states and 36 transitions. [2019-11-28 21:26:12,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 21:26:12,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 21:26:12,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2019-11-28 21:26:12,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:12,843 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-28 21:26:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2019-11-28 21:26:12,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-11-28 21:26:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 21:26:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-11-28 21:26:12,850 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-11-28 21:26:12,850 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-11-28 21:26:12,850 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 21:26:12,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2019-11-28 21:26:12,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:12,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:12,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:12,852 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:12,853 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:26:12,853 INFO L794 eck$LassoCheckResult]: Stem: 858#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 856#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 857#L528 assume !(main_~length1~0 < 1); 846#L528-2 assume !(main_~length2~0 < 1); 847#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 852#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 850#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 851#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 853#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 865#L537-3 assume !(main_~i~0 < main_~length1~0); 854#L537-4 main_~i~1 := 0; 855#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 861#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 862#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 863#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 864#L541-3 assume !(main_~i~1 < main_~length2~0); 844#L541-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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 845#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 848#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 840#L519-3 [2019-11-28 21:26:12,856 INFO L796 eck$LassoCheckResult]: Loop: 840#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 841#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 859#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 840#L519-3 [2019-11-28 21:26:12,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:12,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1483803875, now seen corresponding path program 2 times [2019-11-28 21:26:12,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:12,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672215672] [2019-11-28 21:26:12,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,913 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:12,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:12,916 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 2 times [2019-11-28 21:26:12,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:12,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662476095] [2019-11-28 21:26:12,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,925 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:12,926 INFO L82 PathProgramCache]: Analyzing trace with hash 197886459, now seen corresponding path program 2 times [2019-11-28 21:26:12,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:12,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089478892] [2019-11-28 21:26:12,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,976 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:14,303 WARN L192 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 186 DAG size of output: 152 [2019-11-28 21:26:14,604 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-11-28 21:26:14,607 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:14,607 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:14,607 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:14,607 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:14,607 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:14,607 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:14,607 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:14,608 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:14,608 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration8_Lasso [2019-11-28 21:26:14,608 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:14,608 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:14,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:14,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:14,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:14,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:14,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:14,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:14,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:14,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:14,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:14,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:14,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:14,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:26:14,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:14,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:14,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,059 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-11-28 21:26:15,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,478 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-11-28 21:26:15,907 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:15,907 INFO L489 LassoAnalysis]: Using template 'affine'. 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:26:15,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:15,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:15,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:15,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:15,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:15,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:15,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:15,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:15,915 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:26:15,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:15,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:15,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:15,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:15,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:15,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:15,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:15,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:15,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:15,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:15,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:15,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:15,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:15,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:15,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:15,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:15,936 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:26:15,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:15,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:15,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:15,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:15,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:15,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:15,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:15,948 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:26:15,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:15,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:15,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:15,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:15,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:15,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:15,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:15,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:15,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:15,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:15,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:15,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:15,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:15,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:15,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:15,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:15,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:15,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:15,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:15,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:15,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:15,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:15,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:15,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:15,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:15,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:15,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:15,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:15,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:15,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:15,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:15,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:15,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:15,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:15,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:15,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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:15,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:15,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:15,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:15,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:15,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:16,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:16,010 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:26:16,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:16,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:16,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:16,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:16,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:16,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:16,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:16,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:16,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:16,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:16,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:16,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:16,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:16,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:16,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:16,065 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) [2019-11-28 21:26:16,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:16,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:16,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:16,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,082 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) [2019-11-28 21:26:16,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:16,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:16,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:16,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:16,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:16,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,153 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:16,234 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 21:26:16,234 INFO L444 ModelExtractionUtils]: 8 out of 55 variables were initially zero. Simplification set additionally 44 variables to zero. 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) [2019-11-28 21:26:16,258 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,261 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:26:16,261 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:16,261 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2019-11-28 21:26:16,343 INFO L297 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2019-11-28 21:26:16,345 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:26:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:16,397 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:26:16,403 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:16,426 WARN L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 21:26:16,427 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:16,452 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 21:26:16,452 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 21:26:16,510 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 51 transitions. Complement of second has 6 states. [2019-11-28 21:26:16,514 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:26:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 21:26:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-11-28 21:26:16,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-28 21:26:16,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:16,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-28 21:26:16,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:16,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-28 21:26:16,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:16,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2019-11-28 21:26:16,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:16,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 33 states and 40 transitions. [2019-11-28 21:26:16,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 21:26:16,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 21:26:16,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2019-11-28 21:26:16,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:16,524 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-28 21:26:16,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2019-11-28 21:26:16,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-11-28 21:26:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 21:26:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-11-28 21:26:16,529 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-28 21:26:16,529 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-28 21:26:16,529 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 21:26:16,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-11-28 21:26:16,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:16,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:16,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:16,531 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:16,531 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:26:16,532 INFO L794 eck$LassoCheckResult]: Stem: 1099#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1097#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 1098#L528 assume !(main_~length1~0 < 1); 1086#L528-2 assume !(main_~length2~0 < 1); 1087#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 1093#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1091#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1092#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1094#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1105#L537-3 assume !(main_~i~0 < main_~length1~0); 1095#L537-4 main_~i~1 := 0; 1096#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1102#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1103#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1104#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1106#L541-3 assume !(main_~i~1 < main_~length2~0); 1084#L541-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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 1085#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1088#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1082#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1083#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 1089#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1090#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1080#L519-3 [2019-11-28 21:26:16,532 INFO L796 eck$LassoCheckResult]: Loop: 1080#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1081#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 1100#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 1080#L519-3 [2019-11-28 21:26:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:16,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1839510475, now seen corresponding path program 3 times [2019-11-28 21:26:16,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:16,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561799099] [2019-11-28 21:26:16,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 21:26:16,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561799099] [2019-11-28 21:26:16,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44687460] [2019-11-28 21:26:16,869 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:26:16,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 21:26:16,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:26:16,931 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 21:26:16,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:16,938 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_121|], 1=[|v_#valid_151|]} [2019-11-28 21:26:16,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 21:26:16,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 21:26:16,944 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:26:16,953 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:26:16,960 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-28 21:26:16,960 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 21:26:16,968 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:26:16,969 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:26:16,969 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-11-28 21:26:17,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2019-11-28 21:26:17,073 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:26:17,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:26:17,088 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 21:26:17,088 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:40 [2019-11-28 21:26:17,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2019-11-28 21:26:17,189 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:26:17,218 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:26:17,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 21:26:17,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-11-28 21:26:17,227 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 21:26:17,242 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:26:17,243 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:26:17,243 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:56, output treesize:3 [2019-11-28 21:26:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 21:26:17,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:26:17,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-28 21:26:17,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062430712] [2019-11-28 21:26:17,248 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:26:17,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:17,248 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 3 times [2019-11-28 21:26:17,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:17,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776175538] [2019-11-28 21:26:17,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,255 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:17,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:17,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 21:26:17,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-28 21:26:17,297 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 9 Second operand 16 states. [2019-11-28 21:26:17,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:17,943 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-11-28 21:26:17,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 21:26:17,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 51 transitions. [2019-11-28 21:26:17,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:17,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 30 states and 35 transitions. [2019-11-28 21:26:17,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 21:26:17,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 21:26:17,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2019-11-28 21:26:17,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:17,950 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-28 21:26:17,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2019-11-28 21:26:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-28 21:26:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 21:26:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-11-28 21:26:17,953 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-11-28 21:26:17,953 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-11-28 21:26:17,954 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 21:26:17,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2019-11-28 21:26:17,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:17,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:17,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:17,956 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:17,956 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:26:17,956 INFO L794 eck$LassoCheckResult]: Stem: 1272#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1270#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 1271#L528 assume !(main_~length1~0 < 1); 1258#L528-2 assume !(main_~length2~0 < 1); 1259#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 1265#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1266#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1280#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1263#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1264#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1267#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1279#L537-3 assume !(main_~i~0 < main_~length1~0); 1268#L537-4 main_~i~1 := 0; 1269#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1277#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1278#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1275#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1276#L541-3 assume !(main_~i~1 < main_~length2~0); 1256#L541-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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 1257#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1260#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1254#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1255#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 1261#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1262#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1252#L519-3 [2019-11-28 21:26:17,956 INFO L796 eck$LassoCheckResult]: Loop: 1252#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1253#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 1273#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 1252#L519-3 [2019-11-28 21:26:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:17,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1269061459, now seen corresponding path program 4 times [2019-11-28 21:26:17,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:17,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043813662] [2019-11-28 21:26:17,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,991 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:17,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:17,991 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 4 times [2019-11-28 21:26:17,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:17,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013471707] [2019-11-28 21:26:17,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,998 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:17,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:17,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1987238385, now seen corresponding path program 1 times [2019-11-28 21:26:17,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:18,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797912738] [2019-11-28 21:26:18,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 21:26:18,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797912738] [2019-11-28 21:26:18,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295003187] [2019-11-28 21:26:18,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:26:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:18,125 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 21:26:18,127 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:18,145 INFO L343 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-11-28 21:26:18,146 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 36 treesize of output 21 [2019-11-28 21:26:18,146 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:26:18,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:26:18,154 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-28 21:26:18,154 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2019-11-28 21:26:25,179 WARN L192 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-28 21:26:28,020 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-28 21:26:28,048 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:26:28,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 21 [2019-11-28 21:26:28,049 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:26:28,051 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:26:28,051 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:26:28,051 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2019-11-28 21:26:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 21:26:28,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:26:28,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2019-11-28 21:26:28,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082184538] [2019-11-28 21:26:28,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:28,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 21:26:28,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2019-11-28 21:26:28,102 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. cyclomatic complexity: 9 Second operand 12 states. [2019-11-28 21:26:31,982 WARN L192 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-11-28 21:26:35,126 WARN L192 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-11-28 21:26:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:35,192 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-11-28 21:26:35,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 21:26:35,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2019-11-28 21:26:35,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:35,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2019-11-28 21:26:35,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 21:26:35,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 21:26:35,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2019-11-28 21:26:35,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:35,196 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-11-28 21:26:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2019-11-28 21:26:35,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-11-28 21:26:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 21:26:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-11-28 21:26:35,199 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-28 21:26:35,199 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-28 21:26:35,199 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 21:26:35,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2019-11-28 21:26:35,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:35,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:35,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:35,201 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:35,201 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:26:35,201 INFO L794 eck$LassoCheckResult]: Stem: 1452#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1450#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 1451#L528 assume !(main_~length1~0 < 1); 1439#L528-2 assume !(main_~length2~0 < 1); 1440#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 1446#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1444#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1445#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1447#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1463#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1461#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1460#L537-3 assume !(main_~i~0 < main_~length1~0); 1448#L537-4 main_~i~1 := 0; 1449#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1456#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1457#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1458#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1459#L541-3 assume !(main_~i~1 < main_~length2~0); 1437#L541-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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 1438#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1441#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1435#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1436#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 1454#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 1455#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1462#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 1442#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1443#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1433#L519-3 [2019-11-28 21:26:35,202 INFO L796 eck$LassoCheckResult]: Loop: 1433#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1434#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 1453#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 1433#L519-3 [2019-11-28 21:26:35,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:35,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2062165185, now seen corresponding path program 2 times [2019-11-28 21:26:35,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:35,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043194127] [2019-11-28 21:26:35,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:35,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:35,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 5 times [2019-11-28 21:26:35,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:35,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194016922] [2019-11-28 21:26:35,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:35,242 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:35,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:35,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1249118883, now seen corresponding path program 3 times [2019-11-28 21:26:35,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:35,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73533662] [2019-11-28 21:26:35,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:35,280 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:38,123 WARN L192 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 271 DAG size of output: 218 [2019-11-28 21:26:38,582 WARN L192 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-28 21:26:38,585 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:38,585 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:38,586 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:38,586 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:38,586 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:38,586 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:38,586 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:38,586 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:38,586 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration11_Lasso [2019-11-28 21:26:38,587 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:38,587 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:38,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:38,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:39,235 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-11-28 21:26:39,372 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-28 21:26:39,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:39,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:39,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:39,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:39,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:39,740 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-28 21:26:40,143 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:40,143 INFO L489 LassoAnalysis]: Using template 'affine'. 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:26:40,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:40,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:40,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:40,153 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:26:40,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:40,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:40,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:40,163 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:26:40,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:40,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:40,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:40,177 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) [2019-11-28 21:26:40,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:40,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:40,197 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) [2019-11-28 21:26:40,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:40,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:40,213 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) [2019-11-28 21:26:40,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:40,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:40,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:40,224 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) [2019-11-28 21:26:40,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:40,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:40,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:40,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:40,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:40,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:40,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:40,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:40,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:40,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:40,265 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) [2019-11-28 21:26:40,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:40,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:40,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:40,278 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:40,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:40,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:40,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:40,291 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:40,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:40,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:40,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:40,305 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:40,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:40,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:40,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:40,317 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) [2019-11-28 21:26:40,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:40,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:40,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:40,330 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:26:40,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:40,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:40,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:40,339 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) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:40,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:40,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:40,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:40,349 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:26:40,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:40,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:40,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:40,359 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:26:40,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:40,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:40,376 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) [2019-11-28 21:26:40,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:40,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:40,392 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:26:40,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:40,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:40,421 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:26:40,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:40,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:40,432 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:26:40,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,441 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 21:26:40,441 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2019-11-28 21:26:40,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,464 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2019-11-28 21:26:40,464 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-11-28 21:26:40,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 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:40,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:40,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:40,548 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:26:40,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:40,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:40,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:40,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:40,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:40,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:40,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:40,588 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:40,668 INFO L443 ModelExtractionUtils]: Simplification made 30 calls to the SMT solver. [2019-11-28 21:26:40,668 INFO L444 ModelExtractionUtils]: 26 out of 58 variables were initially zero. Simplification set additionally 29 variables to zero. 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:26:40,672 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:26:40,674 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:26:40,674 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:40,674 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2019-11-28 21:26:40,797 INFO L297 tatePredicateManager]: 26 out of 27 supporting invariants were superfluous and have been removed [2019-11-28 21:26:40,799 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:26:40,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:40,856 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:26:40,857 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:40,869 WARN L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 21:26:40,869 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:40,891 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:26:40,891 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-28 21:26:40,921 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 42 states and 50 transitions. Complement of second has 5 states. [2019-11-28 21:26:40,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:26:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:26:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2019-11-28 21:26:40,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-28 21:26:40,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:40,925 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:26:40,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:40,977 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:26:40,978 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:40,986 WARN L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 21:26:40,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:41,002 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:26:41,002 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-28 21:26:41,040 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 51 transitions. Complement of second has 5 states. [2019-11-28 21:26:41,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:26:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:26:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-11-28 21:26:41,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-28 21:26:41,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:41,042 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:26:41,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:41,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:26:41,105 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:41,115 WARN L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 21:26:41,116 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:41,133 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:26:41,133 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-28 21:26:41,163 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 38 states and 44 transitions. Complement of second has 4 states. [2019-11-28 21:26:41,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:26:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:26:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-11-28 21:26:41,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-28 21:26:41,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:41,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 31 letters. Loop has 3 letters. [2019-11-28 21:26:41,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:41,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 28 letters. Loop has 6 letters. [2019-11-28 21:26:41,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:41,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 44 transitions. [2019-11-28 21:26:41,166 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:26:41,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2019-11-28 21:26:41,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:26:41,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:26:41,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:26:41,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:41,167 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:26:41,167 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:26:41,167 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:26:41,167 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 21:26:41,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 21:26:41,168 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:26:41,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 21:26:41,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:26:41 BoogieIcfgContainer [2019-11-28 21:26:41,173 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:26:41,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:26:41,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:26:41,174 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:26:41,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:02" (3/4) ... [2019-11-28 21:26:41,178 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 21:26:41,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:26:41,180 INFO L168 Benchmark]: Toolchain (without parser) took 39381.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 357.0 MB). Free memory was 955.0 MB in the beginning and 801.3 MB in the end (delta: 153.7 MB). Peak memory consumption was 510.8 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:41,180 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:41,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -129.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:41,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:41,181 INFO L168 Benchmark]: Boogie Preprocessor took 31.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:41,181 INFO L168 Benchmark]: RCFGBuilder took 423.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:41,181 INFO L168 Benchmark]: BuchiAutomizer took 38247.17 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 248.5 MB). Free memory was 1.1 GB in the beginning and 801.3 MB in the end (delta: 257.6 MB). Peak memory consumption was 506.1 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:41,182 INFO L168 Benchmark]: Witness Printer took 4.45 ms. Allocated memory is still 1.4 GB. Free memory is still 801.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:41,184 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 606.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -129.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 423.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 38247.17 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 248.5 MB). Free memory was 1.1 GB in the beginning and 801.3 MB in the end (delta: 257.6 MB). Peak memory consumption was 506.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.45 ms. Allocated memory is still 1.4 GB. Free memory is still 801.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[nondetString1] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * scanp and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * scanp and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 38.1s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 28.5s. Construction of modules took 0.6s. Büchi inclusion checks took 8.8s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 22 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 10. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 221 SDtfs, 381 SDslu, 464 SDs, 0 SdLazy, 493 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital303 mio100 ax108 hnf99 lsp88 ukn59 mio100 lsp45 div100 bol100 ite100 ukn100 eq182 hnf87 smp95 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 101ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 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...