./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 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/termination-memory-alloca/openbsd_cstrpbrk-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash c10d45b5c95e322c3a9476f6a89ce233987fcc3d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:21:25,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:21:25,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:21:25,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:21:25,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:21:25,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:21:25,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:21:25,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:21:25,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:21:25,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:21:25,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:21:25,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:21:25,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:21:25,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:21:25,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:21:25,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:21:25,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:21:25,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:21:25,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:21:25,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:21:25,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:21:25,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:21:25,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:21:25,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:21:25,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:21:25,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:21:25,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:21:25,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:21:25,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:21:25,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:21:25,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:21:25,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:21:25,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:21:25,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:21:25,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:21:25,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:21:25,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:21:25,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:21:25,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:21:25,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:21:25,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:21:25,778 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-19 22:21:25,795 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:21:25,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:21:25,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:21:25,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:21:25,798 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:21:25,798 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 22:21:25,798 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 22:21:25,798 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 22:21:25,799 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 22:21:25,799 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 22:21:25,799 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 22:21:25,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:21:25,800 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:21:25,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:21:25,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:21:25,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 22:21:25,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 22:21:25,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 22:21:25,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:21:25,801 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 22:21:25,801 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:21:25,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 22:21:25,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:21:25,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:21:25,802 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 22:21:25,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:21:25,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:21:25,803 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 22:21:25,804 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 22:21:25,804 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c10d45b5c95e322c3a9476f6a89ce233987fcc3d [2019-11-19 22:21:26,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:21:26,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:21:26,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:21:26,138 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:21:26,139 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:21:26,140 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca-1.i [2019-11-19 22:21:26,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b9a1e8f1/e3e7005ccdea400bb050df6309ddda95/FLAGe515ded4e [2019-11-19 22:21:26,761 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:21:26,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca-1.i [2019-11-19 22:21:26,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b9a1e8f1/e3e7005ccdea400bb050df6309ddda95/FLAGe515ded4e [2019-11-19 22:21:27,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b9a1e8f1/e3e7005ccdea400bb050df6309ddda95 [2019-11-19 22:21:27,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:21:27,126 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:21:27,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:21:27,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:21:27,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:21:27,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:27" (1/1) ... [2019-11-19 22:21:27,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d15d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:27, skipping insertion in model container [2019-11-19 22:21:27,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:27" (1/1) ... [2019-11-19 22:21:27,144 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:21:27,202 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:21:27,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:21:27,756 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:21:27,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:21:27,861 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:21:27,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:27 WrapperNode [2019-11-19 22:21:27,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:21:27,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:21:27,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:21:27,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:21:27,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:27" (1/1) ... [2019-11-19 22:21:27,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:27" (1/1) ... [2019-11-19 22:21:27,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:21:27,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:21:27,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:21:27,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:21:27,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:27" (1/1) ... [2019-11-19 22:21:27,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:27" (1/1) ... [2019-11-19 22:21:27,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:27" (1/1) ... [2019-11-19 22:21:27,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:27" (1/1) ... [2019-11-19 22:21:27,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:27" (1/1) ... [2019-11-19 22:21:27,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:27" (1/1) ... [2019-11-19 22:21:27,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:27" (1/1) ... [2019-11-19 22:21:27,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:21:27,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:21:27,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:21:27,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:21:27,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:27" (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-19 22:21:28,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 22:21:28,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 22:21:28,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:21:28,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:21:28,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:21:28,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:21:28,352 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:21:28,352 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-19 22:21:28,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:28 BoogieIcfgContainer [2019-11-19 22:21:28,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:21:28,354 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 22:21:28,354 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 22:21:28,357 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 22:21:28,358 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:21:28,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 10:21:27" (1/3) ... [2019-11-19 22:21:28,359 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@716191e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:21:28, skipping insertion in model container [2019-11-19 22:21:28,360 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:21:28,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:27" (2/3) ... [2019-11-19 22:21:28,360 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@716191e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:21:28, skipping insertion in model container [2019-11-19 22:21:28,360 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:21:28,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:28" (3/3) ... [2019-11-19 22:21:28,362 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca-1.i [2019-11-19 22:21:28,408 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 22:21:28,409 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 22:21:28,409 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 22:21:28,409 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:21:28,409 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:21:28,410 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 22:21:28,410 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:21:28,410 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 22:21:28,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-19 22:21:28,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-19 22:21:28,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:28,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:28,460 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-19 22:21:28,460 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:28,460 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 22:21:28,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-19 22:21:28,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-19 22:21:28,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:28,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:28,463 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-19 22:21:28,464 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:28,472 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5#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~ret10.base, main_#t~ret10.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; 10#L562true assume !(main_~length1~0 < 1); 14#L562-2true assume !(main_~length2~0 < 1); 6#L565-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;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; 16#L553-4true [2019-11-19 22:21:28,473 INFO L796 eck$LassoCheckResult]: Loop: 16#L553-4true 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; 11#L552-1true assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 13#L553-3true assume !true; 16#L553-4true [2019-11-19 22:21:28,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-19 22:21:28,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:28,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40995068] [2019-11-19 22:21:28,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:28,667 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:28,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:28,668 INFO L82 PathProgramCache]: Analyzing trace with hash 49828, now seen corresponding path program 1 times [2019-11-19 22:21:28,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:28,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201371296] [2019-11-19 22:21:28,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:28,724 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-19 22:21:28,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201371296] [2019-11-19 22:21:28,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:21:28,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-19 22:21:28,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146355054] [2019-11-19 22:21:28,732 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:21:28,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:28,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 22:21:28,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 22:21:28,754 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-11-19 22:21:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:28,763 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-11-19 22:21:28,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 22:21:28,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-11-19 22:21:28,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-19 22:21:28,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2019-11-19 22:21:28,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-19 22:21:28,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-19 22:21:28,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-19 22:21:28,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:28,775 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-19 22:21:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-19 22:21:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-19 22:21:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-19 22:21:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-19 22:21:28,800 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-19 22:21:28,800 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-19 22:21:28,800 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 22:21:28,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-19 22:21:28,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-19 22:21:28,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:28,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:28,801 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-19 22:21:28,801 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:21:28,802 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 38#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~ret10.base, main_#t~ret10.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; 39#L562 assume !(main_~length1~0 < 1); 45#L562-2 assume !(main_~length2~0 < 1); 40#L565-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;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; 41#L553-4 [2019-11-19 22:21:28,802 INFO L796 eck$LassoCheckResult]: Loop: 41#L553-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; 46#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 47#L553-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; 43#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 41#L553-4 [2019-11-19 22:21:28,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:28,802 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-19 22:21:28,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:28,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430056220] [2019-11-19 22:21:28,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:28,843 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:28,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1544297, now seen corresponding path program 1 times [2019-11-19 22:21:28,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:28,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021169273] [2019-11-19 22:21:28,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:28,867 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:28,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1298350894, now seen corresponding path program 1 times [2019-11-19 22:21:28,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:28,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109381353] [2019-11-19 22:21:28,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:28,938 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:29,071 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-19 22:21:29,507 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2019-11-19 22:21:29,641 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-19 22:21:29,658 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:29,659 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:29,660 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:29,664 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:29,664 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:29,665 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:29,665 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:29,665 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:29,665 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-1.i_Iteration2_Lasso [2019-11-19 22:21:29,665 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:29,666 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:29,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:29,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:29,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:29,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:29,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:29,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:29,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,076 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-19 22:21:30,221 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-19 22:21:30,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,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-19 22:21:30,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-19 22:21:30,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-19 22:21:30,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,843 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:30,852 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-19 22:21:30,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:30,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:30,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:30,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:30,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:30,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:30,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:30,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:30,875 INFO L522 LassoAnalysis]: Proving 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-19 22:21:30,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:30,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:30,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:30,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:30,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:30,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:30,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:30,897 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-19 22:21:30,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:30,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:30,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:30,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:30,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:30,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:30,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:30,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:30,919 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-19 22:21:30,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:30,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:30,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:30,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:30,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:30,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:30,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:30,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:30,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:30,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:30,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:30,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:30,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:30,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:30,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:30,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:30,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:30,965 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-19 22:21:30,967 INFO L522 LassoAnalysis]: Proving 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-19 22:21:31,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:31,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:31,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:31,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:31,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:31,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:31,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:31,020 INFO L522 LassoAnalysis]: Proving 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-19 22:21:31,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:31,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:31,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:31,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:31,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:31,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:31,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:31,077 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:31,146 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-19 22:21:31,146 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 8 variables to zero. 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-19 22:21:31,213 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:31,218 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:21:31,218 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:31,219 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_cstrpbrk_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_cstrpbrk_~s1.offset Supporting invariants [] [2019-11-19 22:21:31,257 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-11-19 22:21:31,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 22:21:31,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:31,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:21:31,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:31,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:21:31,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:31,415 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-19 22:21:31,418 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-19 22:21:31,419 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-19 22:21:31,487 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2019-11-19 22:21:31,487 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-19 22:21:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:21:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-19 22:21:31,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-19 22:21:31,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:31,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-19 22:21:31,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:31,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-19 22:21:31,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:31,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-11-19 22:21:31,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:31,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 19 transitions. [2019-11-19 22:21:31,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-19 22:21:31,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-19 22:21:31,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-19 22:21:31,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:31,496 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-19 22:21:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-19 22:21:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-19 22:21:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-19 22:21:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-11-19 22:21:31,498 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-19 22:21:31,498 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-19 22:21:31,499 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 22:21:31,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-11-19 22:21:31,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:31,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:31,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:31,500 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:31,500 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:31,500 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 152#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~ret10.base, main_#t~ret10.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; 153#L562 assume !(main_~length1~0 < 1); 162#L562-2 assume !(main_~length2~0 < 1); 154#L565-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;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; 155#L553-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; 163#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 165#L553-3 [2019-11-19 22:21:31,501 INFO L796 eck$LassoCheckResult]: Loop: 165#L553-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; 157#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 158#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 165#L553-3 [2019-11-19 22:21:31,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:31,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2019-11-19 22:21:31,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:31,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818359467] [2019-11-19 22:21:31,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:31,559 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:31,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:31,560 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 1 times [2019-11-19 22:21:31,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:31,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502421911] [2019-11-19 22:21:31,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:31,570 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:31,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:31,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1594172151, now seen corresponding path program 1 times [2019-11-19 22:21:31,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:31,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65406379] [2019-11-19 22:21:31,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:31,639 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:32,104 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 101 [2019-11-19 22:21:32,246 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-19 22:21:32,248 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:32,248 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:32,248 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:32,249 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:32,249 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:32,249 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:32,249 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:32,249 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:32,249 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-1.i_Iteration3_Lasso [2019-11-19 22:21:32,249 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:32,249 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:32,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,567 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-19 22:21:32,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-19 22:21:32,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-19 22:21:32,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,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-19 22:21:32,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-19 22:21:32,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-19 22:21:32,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-19 22:21:32,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-19 22:21:33,160 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:33,161 INFO L489 LassoAnalysis]: Using template 'affine'. 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-19 22:21:33,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:33,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:33,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:33,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:33,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:33,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:33,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:33,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:33,175 INFO L522 LassoAnalysis]: Proving 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-19 22:21:33,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:33,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:33,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:33,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:33,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:33,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:33,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:33,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:33,187 INFO L522 LassoAnalysis]: Proving 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-19 22:21:33,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:33,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:33,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:33,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:33,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:33,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:33,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:33,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:33,206 INFO L522 LassoAnalysis]: Proving 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-19 22:21:33,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:33,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:33,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:33,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:33,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:33,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:33,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:33,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:33,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:33,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:33,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:33,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:33,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:33,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:33,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:33,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:33,245 INFO L522 LassoAnalysis]: Proving 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-19 22:21:33,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:33,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:33,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:33,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:33,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:33,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:33,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:33,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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:33,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:33,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:33,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:33,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:33,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:33,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:33,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:33,282 INFO L522 LassoAnalysis]: Proving 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-19 22:21:33,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:33,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:33,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:33,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:33,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:33,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:33,304 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-19 22:21:33,309 INFO L522 LassoAnalysis]: Proving 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-19 22:21:33,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:33,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:33,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:33,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:33,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:33,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:33,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:33,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:33,368 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-19 22:21:33,368 INFO L444 ModelExtractionUtils]: 18 out of 28 variables were initially zero. Simplification set additionally 7 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-19 22:21:33,373 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:21:33,375 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:21:33,375 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:33,375 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2019-11-19 22:21:33,430 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-11-19 22:21:33,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 22:21:33,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:33,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:21:33,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:33,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:21:33,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:33,509 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-19 22:21:33,510 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-19 22:21:33,510 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-19 22:21:33,528 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 5 states. [2019-11-19 22:21:33,533 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-19 22:21:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:21:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-19 22:21:33,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-19 22:21:33,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:33,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-19 22:21:33,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:33,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-19 22:21:33,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:33,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-11-19 22:21:33,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:33,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2019-11-19 22:21:33,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-19 22:21:33,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-19 22:21:33,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-11-19 22:21:33,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:33,541 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-19 22:21:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-11-19 22:21:33,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2019-11-19 22:21:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 22:21:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-19 22:21:33,545 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-19 22:21:33,545 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-19 22:21:33,545 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 22:21:33,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-19 22:21:33,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:33,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:33,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:33,548 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:33,548 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:33,548 INFO L794 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 300#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~ret10.base, main_#t~ret10.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; 301#L562 assume !(main_~length1~0 < 1); 310#L562-2 assume !(main_~length2~0 < 1); 302#L565-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;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; 303#L553-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; 311#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 312#L553-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; 307#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 308#L553-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; 314#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 313#L553-3 [2019-11-19 22:21:33,548 INFO L796 eck$LassoCheckResult]: Loop: 313#L553-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; 305#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 306#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 313#L553-3 [2019-11-19 22:21:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:33,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2120273357, now seen corresponding path program 2 times [2019-11-19 22:21:33,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:33,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993642871] [2019-11-19 22:21:33,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:33,589 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:33,589 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 2 times [2019-11-19 22:21:33,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:33,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966172768] [2019-11-19 22:21:33,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:33,599 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:33,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:33,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1020472847, now seen corresponding path program 1 times [2019-11-19 22:21:33,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:33,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457260582] [2019-11-19 22:21:33,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:33,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457260582] [2019-11-19 22:21:33,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938055568] [2019-11-19 22:21:33,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:21:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:33,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-19 22:21:33,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:33,859 INFO L343 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-11-19 22:21:33,860 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-19 22:21:33,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:33,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:33,868 INFO L496 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-19 22:21:33,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2019-11-19 22:21:39,401 WARN L191 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-19 22:21:42,536 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-19 22:21:42,551 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:42,552 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-19 22:21:42,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:42,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:42,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:42,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2019-11-19 22:21:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:42,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:42,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2019-11-19 22:21:42,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062192322] [2019-11-19 22:21:42,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:42,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:21:42,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2019-11-19 22:21:42,610 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 12 states. [2019-11-19 22:21:45,766 WARN L191 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-11-19 22:21:49,443 WARN L191 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-11-19 22:21:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:49,529 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-11-19 22:21:49,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:21:49,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-11-19 22:21:49,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:49,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2019-11-19 22:21:49,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-19 22:21:49,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-19 22:21:49,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-11-19 22:21:49,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:49,532 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-19 22:21:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-11-19 22:21:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2019-11-19 22:21:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-19 22:21:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-19 22:21:49,534 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-19 22:21:49,535 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-19 22:21:49,535 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 22:21:49,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-11-19 22:21:49,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:49,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:49,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:49,536 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:49,536 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:49,536 INFO L794 eck$LassoCheckResult]: Stem: 415#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 411#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~ret10.base, main_#t~ret10.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; 412#L562 assume !(main_~length1~0 < 1); 420#L562-2 assume !(main_~length2~0 < 1); 413#L565-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;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; 414#L553-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; 421#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 422#L553-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; 418#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 419#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 426#L553-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; 427#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 424#L553-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; 425#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 423#L553-3 [2019-11-19 22:21:49,537 INFO L796 eck$LassoCheckResult]: Loop: 423#L553-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; 416#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 417#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 423#L553-3 [2019-11-19 22:21:49,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:49,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1095399647, now seen corresponding path program 2 times [2019-11-19 22:21:49,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:49,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497986686] [2019-11-19 22:21:49,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:49,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:49,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:49,608 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 3 times [2019-11-19 22:21:49,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:49,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671988659] [2019-11-19 22:21:49,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:49,627 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:49,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:49,632 INFO L82 PathProgramCache]: Analyzing trace with hash -110602269, now seen corresponding path program 3 times [2019-11-19 22:21:49,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:49,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76241578] [2019-11-19 22:21:49,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:49,674 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:50,564 WARN L191 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 160 [2019-11-19 22:21:50,763 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-19 22:21:50,765 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:50,765 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:50,766 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:50,766 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:50,766 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:50,766 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:50,766 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:50,766 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:50,767 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-1.i_Iteration5_Lasso [2019-11-19 22:21:50,767 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:50,767 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:50,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:50,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:50,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:50,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:50,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:50,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:50,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:50,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:50,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:50,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:50,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:50,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:50,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:51,439 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-11-19 22:21:51,601 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-19 22:21:51,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:51,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:51,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-19 22:21:51,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-19 22:21:51,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-19 22:21:51,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:51,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-19 22:21:52,029 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-19 22:21:52,872 WARN L191 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-11-19 22:21:53,160 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:53,161 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:53,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:53,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:53,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:53,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:53,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:53,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:53,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:53,199 INFO L522 LassoAnalysis]: Proving 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-19 22:21:53,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:53,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:53,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:53,214 INFO L522 LassoAnalysis]: Proving 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-19 22:21:53,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:53,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:53,230 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-19 22:21:53,232 INFO L522 LassoAnalysis]: Proving 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-19 22:21:53,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:53,243 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-19 22:21:53,247 INFO L522 LassoAnalysis]: Proving 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-19 22:21:53,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:53,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:53,257 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-19 22:21:53,259 INFO L522 LassoAnalysis]: Proving 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-19 22:21:53,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:53,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:53,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:53,271 INFO L522 LassoAnalysis]: Proving 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-19 22:21:53,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:53,288 INFO L402 nArgumentSynthesizer]: A total of 2 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-19 22:21:53,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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:53,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:53,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:53,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:53,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:53,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:53,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:53,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:53,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:53,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:53,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:53,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:53,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:53,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:53,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:53,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:53,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,359 INFO L203 nArgumentSynthesizer]: 12 stem disjuncts [2019-11-19 22:21:53,359 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2019-11-19 22:21:53,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,441 INFO L401 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2019-11-19 22:21:53,441 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-11-19 22:21:53,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:53,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:53,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:53,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:53,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:53,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:53,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:53,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:53,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:53,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:53,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:53,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:53,657 INFO L522 LassoAnalysis]: Proving 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-19 22:21:53,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:53,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:53,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:53,685 INFO L522 LassoAnalysis]: Proving 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-19 22:21:53,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:53,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:53,697 INFO L522 LassoAnalysis]: Proving 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-19 22:21:53,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-19 22:21:53,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:53,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:53,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:53,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:53,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:53,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:53,736 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:53,793 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2019-11-19 22:21:53,793 INFO L444 ModelExtractionUtils]: 23 out of 52 variables were initially zero. Simplification set additionally 26 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:53,799 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:21:53,802 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:21:53,802 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:53,802 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-19 22:21:53,937 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2019-11-19 22:21:53,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 22:21:53,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:53,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:21:53,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:54,003 WARN L253 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:21:54,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:54,019 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-19 22:21:54,020 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-19 22:21:54,020 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-19 22:21:54,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 5 states. [2019-11-19 22:21:54,050 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-19 22:21:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:21:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-19 22:21:54,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-19 22:21:54,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:54,051 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:21:54,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:54,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:21:54,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:54,105 WARN L253 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:21:54,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:54,128 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-19 22:21:54,128 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-19 22:21:54,129 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-19 22:21:54,167 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2019-11-19 22:21:54,167 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-19 22:21:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:21:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-19 22:21:54,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-19 22:21:54,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:54,169 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:21:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:54,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:21:54,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:54,228 WARN L253 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:21:54,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:54,243 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-19 22:21:54,243 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-19 22:21:54,243 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-19 22:21:54,275 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2019-11-19 22:21:54,275 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-19 22:21:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:21:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-11-19 22:21:54,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-19 22:21:54,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:54,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-19 22:21:54,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:54,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-19 22:21:54,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:54,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-19 22:21:54,279 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:21:54,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-11-19 22:21:54,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-19 22:21:54,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-19 22:21:54,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-19 22:21:54,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:54,279 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:21:54,280 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:21:54,280 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:21:54,280 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 22:21:54,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:21:54,280 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:21:54,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-19 22:21:54,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 10:21:54 BoogieIcfgContainer [2019-11-19 22:21:54,287 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 22:21:54,287 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:21:54,287 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:21:54,287 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:21:54,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:28" (3/4) ... [2019-11-19 22:21:54,291 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 22:21:54,292 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:21:54,293 INFO L168 Benchmark]: Toolchain (without parser) took 27168.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.5 MB). Free memory was 956.3 MB in the beginning and 913.3 MB in the end (delta: 43.0 MB). Peak memory consumption was 355.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:54,294 INFO L168 Benchmark]: CDTParser took 0.35 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-19 22:21:54,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 736.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -154.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:54,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:54,295 INFO L168 Benchmark]: Boogie Preprocessor took 30.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:54,296 INFO L168 Benchmark]: RCFGBuilder took 408.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:54,296 INFO L168 Benchmark]: BuchiAutomizer took 25932.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 913.3 MB in the end (delta: 172.3 MB). Peak memory consumption was 354.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:54,297 INFO L168 Benchmark]: Witness Printer took 4.63 ms. Allocated memory is still 1.3 GB. Free memory is still 913.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:54,300 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.35 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 736.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -154.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 408.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25932.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 913.3 MB in the end (delta: 172.3 MB). Peak memory consumption was 354.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.63 ms. Allocated memory is still 1.3 GB. Free memory is still 913.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[scanp] + -1 * scanp and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * scanp and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 18.1s. Construction of modules took 0.1s. Büchi inclusion checks took 7.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 90 SDtfs, 84 SDslu, 56 SDs, 0 SdLazy, 93 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital222 mio100 ax108 hnf99 lsp89 ukn79 mio100 lsp33 div100 bol100 ite100 ukn100 eq194 hnf86 smp98 dnf229 smp90 tf100 neg94 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 249ms VariablesStem: 7 VariablesLoop: 3 DisjunctsStem: 12 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 136 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...