./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/cstrspn.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/cstrspn.c -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 0c74f0cc26425c1a044a70e86941b5dd82b132ff .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:30:16,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:30:16,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:30:16,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:30:16,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:30:16,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:30:16,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:30:16,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:30:16,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:30:16,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:30:16,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:30:16,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:30:16,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:30:16,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:30:16,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:30:16,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:30:16,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:30:16,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:30:16,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:30:16,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:30:16,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:30:16,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:30:16,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:30:16,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:30:16,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:30:16,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:30:16,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:30:16,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:30:16,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:30:16,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:30:16,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:30:16,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:30:16,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:30:16,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:30:16,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:30:16,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:30:16,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:30:16,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:30:16,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:30:16,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:30:16,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:30:16,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:30:16,877 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:30:16,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:30:16,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:30:16,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:30:16,879 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:30:16,879 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:30:16,879 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:30:16,880 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:30:16,880 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:30:16,880 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:30:16,880 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:30:16,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:30:16,881 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:30:16,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:30:16,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:30:16,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:30:16,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:30:16,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:30:16,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:30:16,882 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:30:16,882 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:30:16,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:30:16,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:30:16,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:30:16,883 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:30:16,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:30:16,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:30:16,884 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:30:16,884 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:30:16,885 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:30:16,885 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 -> 0c74f0cc26425c1a044a70e86941b5dd82b132ff [2019-11-28 20:30:17,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:30:17,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:30:17,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:30:17,218 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:30:17,218 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:30:17,219 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/cstrspn.c [2019-11-28 20:30:17,274 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bff36a3dd/52467e4f16bd46f584611e762ed2f699/FLAGc49aa7edf [2019-11-28 20:30:17,671 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:30:17,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/cstrspn.c [2019-11-28 20:30:17,681 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bff36a3dd/52467e4f16bd46f584611e762ed2f699/FLAGc49aa7edf [2019-11-28 20:30:18,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bff36a3dd/52467e4f16bd46f584611e762ed2f699 [2019-11-28 20:30:18,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:30:18,040 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:30:18,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:30:18,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:30:18,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:30:18,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:30:18" (1/1) ... [2019-11-28 20:30:18,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b3a5153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:18, skipping insertion in model container [2019-11-28 20:30:18,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:30:18" (1/1) ... [2019-11-28 20:30:18,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:30:18,087 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:30:18,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:30:18,379 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:30:18,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:30:18,426 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:30:18,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:18 WrapperNode [2019-11-28 20:30:18,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:30:18,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:30:18,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:30:18,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:30:18,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:18" (1/1) ... [2019-11-28 20:30:18,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:18" (1/1) ... [2019-11-28 20:30:18,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:30:18,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:30:18,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:30:18,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:30:18,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:18" (1/1) ... [2019-11-28 20:30:18,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:18" (1/1) ... [2019-11-28 20:30:18,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:18" (1/1) ... [2019-11-28 20:30:18,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:18" (1/1) ... [2019-11-28 20:30:18,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:18" (1/1) ... [2019-11-28 20:30:18,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:18" (1/1) ... [2019-11-28 20:30:18,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:18" (1/1) ... [2019-11-28 20:30:18,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:30:18,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:30:18,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:30:18,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:30:18,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:30:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:30:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:30:18,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:30:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:30:18,984 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:30:18,985 INFO L287 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-28 20:30:18,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:30:18 BoogieIcfgContainer [2019-11-28 20:30:18,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:30:18,987 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:30:18,987 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:30:18,990 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:30:18,991 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:30:18,991 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:30:18" (1/3) ... [2019-11-28 20:30:18,993 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5608ca3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:30:18, skipping insertion in model container [2019-11-28 20:30:18,993 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:30:18,993 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:18" (2/3) ... [2019-11-28 20:30:18,993 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5608ca3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:30:18, skipping insertion in model container [2019-11-28 20:30:18,993 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:30:18,994 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:30:18" (3/3) ... [2019-11-28 20:30:18,995 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrspn.c [2019-11-28 20:30:19,042 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:30:19,042 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:30:19,042 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:30:19,042 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:30:19,042 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:30:19,043 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:30:19,043 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:30:19,043 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:30:19,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 20:30:19,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:30:19,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:19,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:19,083 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:19,084 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:30:19,084 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:30:19,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 20:30:19,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:30:19,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:19,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:19,087 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:19,087 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:30:19,094 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#L-1true havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 22#L14true assume !(build_nondet_String_~length~0 < 1); 19#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 10#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 16#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 12#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 8#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 4#L31-4true [2019-11-28 20:30:19,095 INFO L796 eck$LassoCheckResult]: Loop: 4#L31-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 11#L31-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 9#L34-5true assume !true; 5#L34-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 23#L36true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 6#L31-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 4#L31-4true [2019-11-28 20:30:19,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:19,102 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2019-11-28 20:30:19,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:19,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573500014] [2019-11-28 20:30:19,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:19,303 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:19,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:19,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2019-11-28 20:30:19,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:19,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630075288] [2019-11-28 20:30:19,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:19,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630075288] [2019-11-28 20:30:19,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:30:19,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:30:19,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877694189] [2019-11-28 20:30:19,367 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:30:19,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:19,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:30:19,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:30:19,393 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-11-28 20:30:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:19,403 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2019-11-28 20:30:19,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:30:19,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-11-28 20:30:19,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:30:19,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2019-11-28 20:30:19,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 20:30:19,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 20:30:19,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-11-28 20:30:19,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:30:19,415 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-28 20:30:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-11-28 20:30:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-28 20:30:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 20:30:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-28 20:30:19,442 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-28 20:30:19,442 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-28 20:30:19,442 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:30:19,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-11-28 20:30:19,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:30:19,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:19,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:19,447 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:19,448 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:19,448 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 62#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 63#L14 assume !(build_nondet_String_~length~0 < 1); 65#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 58#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 59#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 60#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 55#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 50#L31-4 [2019-11-28 20:30:19,449 INFO L796 eck$LassoCheckResult]: Loop: 50#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 51#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 56#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 57#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 61#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 52#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 53#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 54#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 50#L31-4 [2019-11-28 20:30:19,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:19,449 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2019-11-28 20:30:19,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:19,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272581752] [2019-11-28 20:30:19,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:19,548 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:19,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:19,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2019-11-28 20:30:19,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:19,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644490098] [2019-11-28 20:30:19,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:19,579 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:19,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:19,580 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2019-11-28 20:30:19,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:19,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140179691] [2019-11-28 20:30:19,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:19,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140179691] [2019-11-28 20:30:19,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:30:19,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:30:19,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655135561] [2019-11-28 20:30:20,076 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-28 20:30:20,380 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-28 20:30:20,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:20,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:30:20,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:30:20,383 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-28 20:30:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:20,606 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-11-28 20:30:20,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:30:20,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2019-11-28 20:30:20,609 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-28 20:30:20,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2019-11-28 20:30:20,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-28 20:30:20,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-28 20:30:20,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2019-11-28 20:30:20,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:30:20,612 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-28 20:30:20,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2019-11-28 20:30:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-11-28 20:30:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:30:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-28 20:30:20,617 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-28 20:30:20,617 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-28 20:30:20,617 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:30:20,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-11-28 20:30:20,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-28 20:30:20,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:20,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:20,620 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:20,620 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:20,620 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 131#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 132#L14 assume !(build_nondet_String_~length~0 < 1); 137#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 126#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 127#L14-3 assume !(build_nondet_String_~length~0 < 1); 129#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 130#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 142#L31-4 [2019-11-28 20:30:20,621 INFO L796 eck$LassoCheckResult]: Loop: 142#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 141#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 124#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 125#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 138#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 139#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 144#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 143#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 142#L31-4 [2019-11-28 20:30:20,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:20,621 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2019-11-28 20:30:20,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:20,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220536942] [2019-11-28 20:30:20,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:20,656 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:20,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:20,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2019-11-28 20:30:20,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:20,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141770286] [2019-11-28 20:30:20,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:20,684 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:20,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:20,690 INFO L82 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2019-11-28 20:30:20,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:20,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695560485] [2019-11-28 20:30:20,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:20,775 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:20,938 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-28 20:30:21,219 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-28 20:30:21,705 WARN L192 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 108 [2019-11-28 20:30:21,861 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 20:30:21,873 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:21,874 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:21,874 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:21,874 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:21,875 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:30:21,875 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:21,875 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:21,875 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:21,876 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration3_Lasso [2019-11-28 20:30:21,876 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:21,876 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:21,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:21,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:21,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,271 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-11-28 20:30:22,432 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-28 20:30:22,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:22,945 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-11-28 20:30:23,450 WARN L192 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-11-28 20:30:23,551 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:23,557 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:23,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:23,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:23,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:23,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:23,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:23,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:23,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:23,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:23,584 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:23,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:23,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:23,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:23,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:23,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:23,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:23,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:23,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:23,600 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:23,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:23,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:23,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:23,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:23,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:23,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:23,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:30:23,659 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:30:23,747 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-28 20:30:23,748 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:23,814 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:23,838 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:30:23,839 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:30:23,839 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2019-11-28 20:30:23,893 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-11-28 20:30:23,903 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:30:23,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:23,960 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:30:23,963 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:23,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:30:23,992 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:24,024 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:30:24,026 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 20:30:24,115 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2019-11-28 20:30:24,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:30:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:30:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-11-28 20:30:24,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2019-11-28 20:30:24,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:24,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2019-11-28 20:30:24,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:24,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2019-11-28 20:30:24,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:24,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2019-11-28 20:30:24,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:30:24,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2019-11-28 20:30:24,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 20:30:24,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:30:24,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2019-11-28 20:30:24,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:30:24,143 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-28 20:30:24,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2019-11-28 20:30:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-28 20:30:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 20:30:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-11-28 20:30:24,148 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-28 20:30:24,148 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-28 20:30:24,148 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:30:24,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-11-28 20:30:24,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:30:24,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:24,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:24,150 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:24,151 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:30:24,151 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 307#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 308#L14 assume !(build_nondet_String_~length~0 < 1); 311#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 302#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 303#L14-3 assume !(build_nondet_String_~length~0 < 1); 304#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 297#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 290#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 292#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 298#L34-5 [2019-11-28 20:30:24,152 INFO L796 eck$LassoCheckResult]: Loop: 298#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 299#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 305#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 298#L34-5 [2019-11-28 20:30:24,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:24,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2019-11-28 20:30:24,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:24,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7928525] [2019-11-28 20:30:24,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:24,224 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:24,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:24,225 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2019-11-28 20:30:24,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:24,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113290090] [2019-11-28 20:30:24,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:24,249 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:24,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:24,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2019-11-28 20:30:24,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:24,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305649424] [2019-11-28 20:30:24,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:24,316 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:24,556 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-28 20:30:25,202 WARN L192 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2019-11-28 20:30:25,399 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-28 20:30:25,403 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:25,403 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:25,403 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:25,403 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:25,404 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:30:25,404 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:25,404 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:25,404 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:25,404 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration4_Lasso [2019-11-28 20:30:25,404 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:25,404 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:25,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,870 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-11-28 20:30:25,995 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-28 20:30:26,275 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-28 20:30:26,694 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-28 20:30:27,359 WARN L192 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-11-28 20:30:27,384 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:27,384 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:27,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:27,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:27,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:27,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:27,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:27,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:27,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:27,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:27,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:27,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:27,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:27,457 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:27,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:27,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:27,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:27,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:30:27,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:27,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:27,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:27,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:27,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:27,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:27,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:27,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:27,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:27,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:27,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:27,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:27,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:27,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,576 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-28 20:30:27,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:27,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:27,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:27,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:27,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:27,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:27,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:27,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:27,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:27,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,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-28 20:30:27,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:27,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:27,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:27,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:27,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:27,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:27,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:27,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:27,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:27,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:27,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:30:27,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:27,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:27,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:30:27,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:27,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:27,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:27,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:27,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,791 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:27,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,804 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 20:30:27,804 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-28 20:30:27,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,869 INFO L401 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-11-28 20:30:27,869 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-28 20:30:27,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:27,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:27,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:27,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:27,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:27,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:27,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:27,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:30:28,019 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:30:28,080 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 20:30:28,080 INFO L444 ModelExtractionUtils]: 34 out of 52 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:28,086 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:30:28,088 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:30:28,089 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:30:28,089 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-11-28 20:30:28,142 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-11-28 20:30:28,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:30:28,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:28,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:30:28,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:28,233 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:30:28,234 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:28,252 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-28 20:30:28,252 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-11-28 20:30:28,336 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 49 states and 59 transitions. Complement of second has 7 states. [2019-11-28 20:30:28,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:30:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:30:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-28 20:30:28,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-28 20:30:28,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:28,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-28 20:30:28,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:28,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 20:30:28,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:28,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2019-11-28 20:30:28,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:30:28,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2019-11-28 20:30:28,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 20:30:28,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 20:30:28,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2019-11-28 20:30:28,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:30:28,343 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-28 20:30:28,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2019-11-28 20:30:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-11-28 20:30:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:30:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-28 20:30:28,346 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-28 20:30:28,346 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-28 20:30:28,346 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:30:28,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2019-11-28 20:30:28,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:30:28,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:28,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:28,348 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:28,348 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:30:28,348 INFO L794 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 496#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 497#L14 assume !(build_nondet_String_~length~0 < 1); 500#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 490#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 491#L14-3 assume !(build_nondet_String_~length~0 < 1); 493#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 485#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 477#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 478#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 492#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 499#L34-1 assume !cstrspn_#t~short7; 495#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 482#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 483#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 484#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 479#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 481#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 486#L34-5 [2019-11-28 20:30:28,348 INFO L796 eck$LassoCheckResult]: Loop: 486#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 487#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 494#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 486#L34-5 [2019-11-28 20:30:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:28,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2019-11-28 20:30:28,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:28,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223792154] [2019-11-28 20:30:28,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:28,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223792154] [2019-11-28 20:30:28,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:30:28,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:30:28,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136426567] [2019-11-28 20:30:28,426 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:30:28,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2019-11-28 20:30:28,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:28,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567779279] [2019-11-28 20:30:28,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:28,444 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:28,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:28,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:30:28,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:30:28,616 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-11-28 20:30:28,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:28,712 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-11-28 20:30:28,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:30:28,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-11-28 20:30:28,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:30:28,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 31 transitions. [2019-11-28 20:30:28,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 20:30:28,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:30:28,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2019-11-28 20:30:28,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:30:28,715 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-28 20:30:28,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2019-11-28 20:30:28,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 20:30:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:30:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-28 20:30:28,718 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-28 20:30:28,718 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-28 20:30:28,718 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:30:28,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-11-28 20:30:28,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:30:28,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:28,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:28,720 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:28,720 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:30:28,720 INFO L794 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 568#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 569#L14 assume !(build_nondet_String_~length~0 < 1); 576#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 565#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 566#L14-3 assume !(build_nondet_String_~length~0 < 1); 567#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 560#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 552#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 553#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 572#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 574#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 575#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 557#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 558#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 559#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 554#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 556#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 561#L34-5 [2019-11-28 20:30:28,720 INFO L796 eck$LassoCheckResult]: Loop: 561#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 562#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 570#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 561#L34-5 [2019-11-28 20:30:28,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:28,721 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2019-11-28 20:30:28,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:28,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040887140] [2019-11-28 20:30:28,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:28,751 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:28,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:28,752 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2019-11-28 20:30:28,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:28,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574966582] [2019-11-28 20:30:28,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:28,760 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:28,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:28,761 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2019-11-28 20:30:28,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:28,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370741309] [2019-11-28 20:30:28,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:28,797 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:29,738 WARN L192 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 157 [2019-11-28 20:30:30,941 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 112 DAG size of output: 112 [2019-11-28 20:30:30,944 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:30,945 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:30,945 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:30,945 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:30,945 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:30:30,945 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:30,945 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:30,945 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:30,945 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration6_Lasso [2019-11-28 20:30:30,945 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:30,945 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:30,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:31,154 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-28 20:30:32,048 WARN L192 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2019-11-28 20:30:32,196 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-28 20:30:32,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:32,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:32,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:32,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:32,374 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-28 20:30:33,009 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-11-28 20:30:33,229 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-28 20:30:33,935 WARN L192 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-11-28 20:30:33,986 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:33,989 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:34,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:34,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:34,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:34,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:34,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:34,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:34,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:34,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:34,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:34,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:34,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:34,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:34,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:34,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:34,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:34,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:34,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:34,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:34,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:34,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:34,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:34,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:34,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:34,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:34,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:30:34,083 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-28 20:30:34,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:34,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:34,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:34,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:34,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:34,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:34,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:34,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:34,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:34,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:34,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:34,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:34,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:34,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:34,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:34,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:34,120 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) [2019-11-28 20:30:34,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:34,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:34,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:34,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:34,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,138 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-28 20:30:34,138 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-28 20:30:34,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,226 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-11-28 20:30:34,226 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-28 20:30:34,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:34,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:34,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:34,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:34,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:34,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:34,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:34,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:34,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:34,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:34,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-28 20:30:34,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:34,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:34,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:34,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:34,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:34,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,681 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:30:34,730 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 20:30:34,730 INFO L444 ModelExtractionUtils]: 32 out of 46 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:34,738 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:34,742 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:30:34,743 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:30:34,743 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-11-28 20:30:34,845 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2019-11-28 20:30:34,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:30:34,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:34,907 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:30:34,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:34,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:30:34,924 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:34,943 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:30:34,944 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 20:30:34,972 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 43 states and 48 transitions. Complement of second has 5 states. [2019-11-28 20:30:34,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:30:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:30:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-11-28 20:30:34,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-28 20:30:34,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:34,975 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:30:34,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:35,014 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:30:35,015 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:35,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:30:35,025 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:35,037 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:30:35,037 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 20:30:35,062 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 43 states and 48 transitions. Complement of second has 5 states. [2019-11-28 20:30:35,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:30:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:30:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-11-28 20:30:35,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-28 20:30:35,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:35,065 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:30:35,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:35,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:30:35,110 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:35,125 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:30:35,125 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:35,140 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:30:35,140 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 20:30:35,168 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 42 states and 48 transitions. Complement of second has 4 states. [2019-11-28 20:30:35,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:30:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:30:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-11-28 20:30:35,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-28 20:30:35,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:35,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 21 letters. Loop has 3 letters. [2019-11-28 20:30:35,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:35,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 6 letters. [2019-11-28 20:30:35,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:35,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2019-11-28 20:30:35,178 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:30:35,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2019-11-28 20:30:35,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:30:35,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:30:35,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:30:35,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:30:35,181 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:30:35,181 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:30:35,182 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:30:35,182 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:30:35,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:30:35,182 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:30:35,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:30:35,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:30:35 BoogieIcfgContainer [2019-11-28 20:30:35,192 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:30:35,193 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:30:35,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:30:35,194 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:30:35,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:30:18" (3/4) ... [2019-11-28 20:30:35,198 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:30:35,198 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:30:35,206 INFO L168 Benchmark]: Toolchain (without parser) took 17160.57 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 196.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:35,207 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:30:35,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.20 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:35,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:35,208 INFO L168 Benchmark]: Boogie Preprocessor took 40.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:35,209 INFO L168 Benchmark]: RCFGBuilder took 404.95 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:35,209 INFO L168 Benchmark]: BuchiAutomizer took 16205.71 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.1 MB). Peak memory consumption was 205.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:35,210 INFO L168 Benchmark]: Witness Printer took 5.77 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:30:35,213 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.18 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 386.20 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 112.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 404.95 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16205.71 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.1 MB). Peak memory consumption was 205.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.77 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[build_nondet_String()] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 14.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 138 SDtfs, 138 SDslu, 119 SDs, 0 SdLazy, 177 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital381 mio100 ax100 hnf99 lsp91 ukn71 mio100 lsp33 div124 bol100 ite100 ukn100 eq169 hnf82 smp88 dnf674 smp45 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 416ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...