./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5cff20f2f9db1407772cc4ac909fa32770d83e71 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:53:03,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:53:03,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:53:04,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:53:04,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:53:04,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:53:04,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:53:04,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:53:04,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:53:04,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:53:04,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:53:04,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:53:04,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:53:04,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:53:04,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:53:04,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:53:04,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:53:04,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:53:04,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:53:04,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:53:04,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:53:04,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:53:04,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:53:04,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:53:04,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:53:04,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:53:04,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:53:04,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:53:04,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:53:04,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:53:04,067 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:53:04,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:53:04,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:53:04,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:53:04,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:53:04,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:53:04,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:53:04,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:53:04,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:53:04,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:53:04,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:53:04,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:53:04,114 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:53:04,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:53:04,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:53:04,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:53:04,120 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:53:04,120 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:53:04,120 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:53:04,121 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:53:04,121 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:53:04,121 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:53:04,121 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:53:04,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:53:04,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:53:04,122 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:53:04,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:53:04,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:53:04,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:53:04,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:53:04,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:53:04,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:53:04,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:53:04,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:53:04,124 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:53:04,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:53:04,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:53:04,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:53:04,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:53:04,125 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:53:04,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:53:04,125 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:53:04,125 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:53:04,126 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:53:04,127 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5cff20f2f9db1407772cc4ac909fa32770d83e71 [2019-11-28 03:53:04,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:53:04,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:53:04,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:53:04,509 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:53:04,510 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:53:04,512 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2019-11-28 03:53:04,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a10f1d79b/b66bdfc428884e90b82ceeb4ea89bc55/FLAGe54cd2dc4 [2019-11-28 03:53:05,117 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:53:05,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2019-11-28 03:53:05,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a10f1d79b/b66bdfc428884e90b82ceeb4ea89bc55/FLAGe54cd2dc4 [2019-11-28 03:53:05,437 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a10f1d79b/b66bdfc428884e90b82ceeb4ea89bc55 [2019-11-28 03:53:05,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:53:05,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:53:05,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:53:05,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:53:05,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:53:05,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:53:05" (1/1) ... [2019-11-28 03:53:05,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b7bf631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:05, skipping insertion in model container [2019-11-28 03:53:05,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:53:05" (1/1) ... [2019-11-28 03:53:05,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:53:05,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:53:05,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:53:05,923 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:53:05,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:53:06,046 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:53:06,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:06 WrapperNode [2019-11-28 03:53:06,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:53:06,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:53:06,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:53:06,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:53:06,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:06" (1/1) ... [2019-11-28 03:53:06,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:06" (1/1) ... [2019-11-28 03:53:06,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:53:06,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:53:06,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:53:06,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:53:06,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:06" (1/1) ... [2019-11-28 03:53:06,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:06" (1/1) ... [2019-11-28 03:53:06,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:06" (1/1) ... [2019-11-28 03:53:06,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:06" (1/1) ... [2019-11-28 03:53:06,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:06" (1/1) ... [2019-11-28 03:53:06,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:06" (1/1) ... [2019-11-28 03:53:06,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:06" (1/1) ... [2019-11-28 03:53:06,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:53:06,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:53:06,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:53:06,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:53:06,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:06" (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 03:53:06,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:53:06,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:53:06,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:53:06,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:53:06,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:53:06,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:53:06,591 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:53:06,591 INFO L297 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-28 03:53:06,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:53:06 BoogieIcfgContainer [2019-11-28 03:53:06,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:53:06,594 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:53:06,594 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:53:06,598 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:53:06,599 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:53:06,599 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:53:05" (1/3) ... [2019-11-28 03:53:06,600 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@510a925f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:53:06, skipping insertion in model container [2019-11-28 03:53:06,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:53:06,601 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:06" (2/3) ... [2019-11-28 03:53:06,601 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@510a925f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:53:06, skipping insertion in model container [2019-11-28 03:53:06,601 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:53:06,602 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:53:06" (3/3) ... [2019-11-28 03:53:06,605 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrpbrk-alloca-2.i [2019-11-28 03:53:06,646 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:53:06,646 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:53:06,647 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:53:06,647 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:53:06,647 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:53:06,647 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:53:06,647 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:53:06,648 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:53:06,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-28 03:53:06,683 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-28 03:53:06,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:06,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:06,691 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:53:06,691 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:06,691 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:53:06,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-28 03:53:06,694 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-28 03:53:06,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:06,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:06,695 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:53:06,695 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:06,703 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 14#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 9#L535-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 25#L541-3true [2019-11-28 03:53:06,704 INFO L796 eck$LassoCheckResult]: Loop: 25#L541-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 22#L541-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 25#L541-3true [2019-11-28 03:53:06,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:06,710 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-28 03:53:06,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:06,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517458852] [2019-11-28 03:53:06,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:06,852 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:06,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:06,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-28 03:53:06,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:06,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714266808] [2019-11-28 03:53:06,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:06,877 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:06,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:06,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-28 03:53:06,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:06,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716050418] [2019-11-28 03:53:06,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:06,935 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:07,216 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-28 03:53:07,310 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:07,311 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:07,312 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:07,312 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:07,312 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:07,312 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:07,313 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:07,313 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:07,313 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration1_Lasso [2019-11-28 03:53:07,314 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:07,314 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:07,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,520 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-28 03:53:07,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:07,983 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:53:07,990 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 03:53:08,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:08,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:08,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:08,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:08,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:08,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:08,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:08,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:08,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:08,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:08,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:08,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:08,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:08,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:08,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:08,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:08,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:08,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:08,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:08,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:08,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:08,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:08,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:08,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:08,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:08,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:08,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:08,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:08,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:08,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:08,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:08,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:08,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:08,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:08,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:08,142 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:08,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:08,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:08,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:08,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:08,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:08,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:08,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:08,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:08,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:08,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:08,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:08,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:08,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:08,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:08,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:08,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:08,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:08,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:08,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:08,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:08,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:08,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:08,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:08,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:08,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:08,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:08,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:08,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:08,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:08,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:08,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:08,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:08,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:08,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:08,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:08,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:08,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:08,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:08,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:08,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:08,303 INFO L522 LassoAnalysis]: Proving 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 03:53:08,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:08,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:08,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:08,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:08,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:08,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:08,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:08,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:53:08,433 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-28 03:53:08,433 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:08,484 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:53:08,491 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:53:08,491 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:53:08,492 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:53:08,519 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 03:53:08,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:08,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:53:08,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:08,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:53:08,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:08,602 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 03:53:08,620 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 03:53:08,621 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-11-28 03:53:08,693 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 60 states and 87 transitions. Complement of second has 7 states. [2019-11-28 03:53:08,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:53:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:53:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2019-11-28 03:53:08,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 03:53:08,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:08,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 03:53:08,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:08,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 03:53:08,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:08,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2019-11-28 03:53:08,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 03:53:08,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2019-11-28 03:53:08,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 03:53:08,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 03:53:08,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-28 03:53:08,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:08,714 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-28 03:53:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-28 03:53:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 03:53:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 03:53:08,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-11-28 03:53:08,745 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-28 03:53:08,745 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-28 03:53:08,745 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:53:08,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-11-28 03:53:08,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 03:53:08,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:08,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:08,747 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:08,747 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:08,747 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 167#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 168#L532 assume !(main_~length1~0 < 1); 169#L532-2 assume !(main_~length2~0 < 1); 163#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 164#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 160#L541-4 main_~i~1 := 0; 161#L546-3 [2019-11-28 03:53:08,747 INFO L796 eck$LassoCheckResult]: Loop: 161#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 165#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 161#L546-3 [2019-11-28 03:53:08,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:08,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-28 03:53:08,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:08,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703672327] [2019-11-28 03:53:08,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,775 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:08,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:08,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-28 03:53:08,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:08,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243910779] [2019-11-28 03:53:08,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:08,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:08,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-11-28 03:53:08,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:08,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001985890] [2019-11-28 03:53:08,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,866 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:09,103 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-28 03:53:09,187 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:09,187 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:09,187 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:09,187 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:09,187 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:09,188 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,190 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:09,190 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:09,190 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration2_Lasso [2019-11-28 03:53:09,190 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:09,191 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:09,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:09,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:09,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 03:53:09,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:09,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:09,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:09,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:09,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:09,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:09,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:09,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:09,406 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-28 03:53:09,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:09,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:09,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 03:53:09,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 03:53:09,783 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:53:09,784 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,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 [2019-11-28 03:53:09,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,806 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 03:53:09,808 INFO L522 LassoAnalysis]: Proving 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 03:53:09,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:09,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:09,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,850 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 03:53:09,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:09,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:09,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:09,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,907 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 03:53:09,911 INFO L522 LassoAnalysis]: Proving 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 03:53:09,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:09,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,934 INFO L522 LassoAnalysis]: Proving 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) [2019-11-28 03:53:09,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:09,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,959 INFO L522 LassoAnalysis]: Proving 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 03:53:09,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,981 INFO L402 nArgumentSynthesizer]: A total of 2 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 03:53:09,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:10,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:10,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:10,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:10,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:10,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:10,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:10,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:10,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:10,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:10,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:10,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:10,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:10,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:10,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:10,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:10,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:10,044 INFO L522 LassoAnalysis]: Proving 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 03:53:10,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:10,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:10,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:10,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:10,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:10,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:10,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:10,067 INFO L522 LassoAnalysis]: Proving 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 03:53:10,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:10,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:10,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:10,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:10,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:10,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:10,086 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 03:53:10,105 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:53:10,143 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-28 03:53:10,143 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:10,148 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:10,151 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:53:10,151 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:53:10,151 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-11-28 03:53:10,173 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 03:53:10,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:10,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:53:10,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:10,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:53:10,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:10,227 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 03:53:10,227 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 03:53:10,227 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 03:53:10,261 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 44 transitions. Complement of second has 6 states. [2019-11-28 03:53:10,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:53:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:53:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-11-28 03:53:10,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 03:53:10,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:10,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-28 03:53:10,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:10,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-28 03:53:10,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:10,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2019-11-28 03:53:10,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:53:10,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2019-11-28 03:53:10,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 03:53:10,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:53:10,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2019-11-28 03:53:10,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:10,274 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-28 03:53:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2019-11-28 03:53:10,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 03:53:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 03:53:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2019-11-28 03:53:10,280 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-28 03:53:10,280 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-28 03:53:10,280 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:53:10,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2019-11-28 03:53:10,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:53:10,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:10,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:10,285 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:10,285 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:10,285 INFO L794 eck$LassoCheckResult]: Stem: 298#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 293#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 294#L532 assume !(main_~length1~0 < 1); 295#L532-2 assume !(main_~length2~0 < 1); 288#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 289#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 285#L541-4 main_~i~1 := 0; 286#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 292#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 284#L519-4 [2019-11-28 03:53:10,286 INFO L796 eck$LassoCheckResult]: Loop: 284#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 287#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 299#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 296#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 297#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5; 281#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 282#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 283#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 284#L519-4 [2019-11-28 03:53:10,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-11-28 03:53:10,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:10,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059984213] [2019-11-28 03:53:10,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,373 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:10,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,373 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2019-11-28 03:53:10,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:10,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729672018] [2019-11-28 03:53:10,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,424 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2019-11-28 03:53:10,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:10,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772475072] [2019-11-28 03:53:10,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:10,715 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 03:53:10,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772475072] [2019-11-28 03:53:10,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:53:10,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 03:53:10,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184815307] [2019-11-28 03:53:10,866 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-28 03:53:11,106 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-28 03:53:11,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:11,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 03:53:11,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 03:53:11,113 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand 10 states. [2019-11-28 03:53:11,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:11,457 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2019-11-28 03:53:11,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 03:53:11,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2019-11-28 03:53:11,459 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-28 03:53:11,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 64 transitions. [2019-11-28 03:53:11,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-28 03:53:11,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-11-28 03:53:11,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2019-11-28 03:53:11,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:11,463 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-11-28 03:53:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2019-11-28 03:53:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2019-11-28 03:53:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 03:53:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2019-11-28 03:53:11,468 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-11-28 03:53:11,468 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-11-28 03:53:11,468 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:53:11,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2019-11-28 03:53:11,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-28 03:53:11,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:11,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:11,470 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:11,470 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:53:11,470 INFO L794 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 396#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 397#L532 assume !(main_~length1~0 < 1); 398#L532-2 assume !(main_~length2~0 < 1); 390#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 391#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 408#L541-4 main_~i~1 := 0; 394#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 395#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 412#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 411#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 404#L522-5 [2019-11-28 03:53:11,470 INFO L796 eck$LassoCheckResult]: Loop: 404#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 409#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 403#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 404#L522-5 [2019-11-28 03:53:11,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:11,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759941, now seen corresponding path program 1 times [2019-11-28 03:53:11,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:11,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895476193] [2019-11-28 03:53:11,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:11,589 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 03:53:11,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895476193] [2019-11-28 03:53:11,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:53:11,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 03:53:11,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326289635] [2019-11-28 03:53:11,590 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:53:11,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:11,591 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2019-11-28 03:53:11,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:11,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458294555] [2019-11-28 03:53:11,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:11,602 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:11,777 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-28 03:53:11,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:11,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:53:11,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:53:11,780 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand 7 states. [2019-11-28 03:53:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:11,887 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-28 03:53:11,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:53:11,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-11-28 03:53:11,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:53:11,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 29 transitions. [2019-11-28 03:53:11,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 03:53:11,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:53:11,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2019-11-28 03:53:11,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:11,890 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-11-28 03:53:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2019-11-28 03:53:11,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-28 03:53:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 03:53:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-11-28 03:53:11,893 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-28 03:53:11,893 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-28 03:53:11,893 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:53:11,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-11-28 03:53:11,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:53:11,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:11,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:11,895 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:11,895 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:11,895 INFO L794 eck$LassoCheckResult]: Stem: 475#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 470#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 471#L532 assume !(main_~length1~0 < 1); 472#L532-2 assume !(main_~length2~0 < 1); 465#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 466#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 477#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 478#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 462#L541-4 main_~i~1 := 0; 463#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 469#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 461#L519-4 [2019-11-28 03:53:11,895 INFO L796 eck$LassoCheckResult]: Loop: 461#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 464#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 476#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 473#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 474#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5; 458#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 459#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 460#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 461#L519-4 [2019-11-28 03:53:11,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:11,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-28 03:53:11,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:11,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295838206] [2019-11-28 03:53:11,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:11,945 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:11,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:11,947 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 2 times [2019-11-28 03:53:11,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:11,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391918636] [2019-11-28 03:53:11,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:11,962 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:11,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:11,963 INFO L82 PathProgramCache]: Analyzing trace with hash -164170776, now seen corresponding path program 1 times [2019-11-28 03:53:11,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:11,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244909213] [2019-11-28 03:53:11,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:53:12,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244909213] [2019-11-28 03:53:12,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:53:12,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 03:53:12,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928071605] [2019-11-28 03:53:12,308 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-28 03:53:12,567 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-28 03:53:12,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:12,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 03:53:12,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-28 03:53:12,569 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 10 states. [2019-11-28 03:53:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:12,772 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2019-11-28 03:53:12,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 03:53:12,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2019-11-28 03:53:12,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-28 03:53:12,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 44 transitions. [2019-11-28 03:53:12,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-28 03:53:12,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-28 03:53:12,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2019-11-28 03:53:12,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:12,775 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-28 03:53:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2019-11-28 03:53:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-28 03:53:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 03:53:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-11-28 03:53:12,778 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 03:53:12,778 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 03:53:12,779 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:53:12,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-11-28 03:53:12,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-28 03:53:12,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:12,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:12,780 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:12,780 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:12,780 INFO L794 eck$LassoCheckResult]: Stem: 560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 555#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 556#L532 assume !(main_~length1~0 < 1); 557#L532-2 assume !(main_~length2~0 < 1); 549#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 550#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 565#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 566#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 544#L541-4 main_~i~1 := 0; 545#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 553#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 546#L519-4 [2019-11-28 03:53:12,780 INFO L796 eck$LassoCheckResult]: Loop: 546#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 547#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 568#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 567#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 561#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 562#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 558#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 559#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5; 540#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 541#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 548#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 546#L519-4 [2019-11-28 03:53:12,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:12,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2019-11-28 03:53:12,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:12,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521160880] [2019-11-28 03:53:12,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:12,801 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash -898285594, now seen corresponding path program 1 times [2019-11-28 03:53:12,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:12,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259029204] [2019-11-28 03:53:12,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:12,819 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:12,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:12,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1809250353, now seen corresponding path program 1 times [2019-11-28 03:53:12,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:12,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384088336] [2019-11-28 03:53:12,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:53:12,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384088336] [2019-11-28 03:53:12,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775619288] [2019-11-28 03:53:12,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:53:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:12,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 03:53:12,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:13,011 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:53:13,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-28 03:53:13,013 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:53:13,028 INFO L588 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-28 03:53:13,029 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:53:13,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:5 [2019-11-28 03:53:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:53:13,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 03:53:13,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2019-11-28 03:53:13,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768576629] [2019-11-28 03:53:13,373 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-11-28 03:53:13,679 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-28 03:53:13,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:13,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 03:53:13,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-11-28 03:53:13,681 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 9 states. [2019-11-28 03:53:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:13,861 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2019-11-28 03:53:13,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:53:13,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2019-11-28 03:53:13,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:53:13,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 28 transitions. [2019-11-28 03:53:13,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 03:53:13,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:53:13,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2019-11-28 03:53:13,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:13,864 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-28 03:53:13,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2019-11-28 03:53:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-28 03:53:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 03:53:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-11-28 03:53:13,866 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-28 03:53:13,866 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-28 03:53:13,866 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:53:13,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2019-11-28 03:53:13,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:53:13,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:13,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:13,868 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:13,868 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:13,868 INFO L794 eck$LassoCheckResult]: Stem: 712#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 707#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 708#L532 assume !(main_~length1~0 < 1); 709#L532-2 assume !(main_~length2~0 < 1); 702#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 703#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 714#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 715#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 699#L541-4 main_~i~1 := 0; 700#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 704#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 705#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 706#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 698#L519-4 [2019-11-28 03:53:13,868 INFO L796 eck$LassoCheckResult]: Loop: 698#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 701#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 713#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 710#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 711#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5; 695#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 696#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 697#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 698#L519-4 [2019-11-28 03:53:13,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-28 03:53:13,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383250361] [2019-11-28 03:53:13,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,892 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:13,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,893 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 3 times [2019-11-28 03:53:13,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456471955] [2019-11-28 03:53:13,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,916 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1875279350, now seen corresponding path program 1 times [2019-11-28 03:53:13,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763723193] [2019-11-28 03:53:13,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:14,107 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-28 03:53:14,321 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-28 03:53:14,794 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2019-11-28 03:53:14,978 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-28 03:53:14,981 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:14,982 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:14,982 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:14,982 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:14,982 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:14,982 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:14,982 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:14,983 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:14,983 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration7_Lasso [2019-11-28 03:53:14,983 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:14,983 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:14,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 03:53:14,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:14,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:14,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:14,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,536 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-11-28 03:53:15,825 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-11-28 03:53:15,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:16,353 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-11-28 03:53:16,627 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:53:16,628 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:53:16,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:53:16,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:16,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,676 INFO L522 LassoAnalysis]: Proving 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 03:53:16,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:53:16,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:53:16,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,716 INFO L522 LassoAnalysis]: Proving 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 03:53:16,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:53:16,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:16,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:16,744 INFO L522 LassoAnalysis]: Proving 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 03:53:16,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:16,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:16,762 INFO L522 LassoAnalysis]: Proving 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 03:53:16,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:16,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,777 INFO L522 LassoAnalysis]: Proving 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 03:53:16,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:16,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,819 INFO L522 LassoAnalysis]: Proving 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 03:53:16,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:16,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:16,836 INFO L522 LassoAnalysis]: Proving 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 03:53:16,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:16,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:16,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:16,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:16,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:16,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:16,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:16,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:16,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:16,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:16,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,975 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:53:16,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,986 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-28 03:53:16,986 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:17,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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:17,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:17,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:17,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:17,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:17,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:17,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:17,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:17,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:17,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:17,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:17,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:17,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:17,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:17,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:17,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:17,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:17,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:17,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:17,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:17,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:17,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:17,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:17,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:17,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:17,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:17,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:17,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:17,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:17,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:17,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:17,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:17,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:17,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:17,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:17,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:17,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:17,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:17,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:17,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:17,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:17,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:17,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:17,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:17,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:17,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:17,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:17,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:17,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:17,150 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:53:17,246 INFO L443 ModelExtractionUtils]: Simplification made 32 calls to the SMT solver. [2019-11-28 03:53:17,246 INFO L444 ModelExtractionUtils]: 13 out of 55 variables were initially zero. Simplification set additionally 37 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:17,252 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:53:17,254 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:53:17,255 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:53:17,255 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_main_~length1~0) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*ULTIMATE.start_main_~length1~0 Supporting invariants [1*ULTIMATE.start_main_~length1~0 - 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_3 >= 0] [2019-11-28 03:53:17,328 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2019-11-28 03:53:17,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:17,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 03:53:17,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:17,382 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_90|], 1=[|v_#valid_122|]} [2019-11-28 03:53:17,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:53:17,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 03:53:17,387 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:53:17,397 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:53:17,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-28 03:53:17,412 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:53:17,419 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:53:17,420 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:53:17,420 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:22, output treesize:10 [2019-11-28 03:53:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:17,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:53:17,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:17,464 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 03:53:17,465 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 03:53:17,465 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 03:53:17,544 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 29 states and 38 transitions. Complement of second has 5 states. [2019-11-28 03:53:17,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:53:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:53:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-11-28 03:53:17,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-28 03:53:17,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:17,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 8 letters. [2019-11-28 03:53:17,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:17,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 16 letters. [2019-11-28 03:53:17,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:17,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-11-28 03:53:17,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:53:17,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2019-11-28 03:53:17,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 03:53:17,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 03:53:17,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2019-11-28 03:53:17,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:53:17,553 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-28 03:53:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2019-11-28 03:53:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 03:53:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 03:53:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-28 03:53:17,554 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-28 03:53:17,554 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-28 03:53:17,555 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:53:17,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-11-28 03:53:17,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:53:17,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:17,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:17,556 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:17,556 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:53:17,557 INFO L794 eck$LassoCheckResult]: Stem: 921#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 914#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 915#L532 assume !(main_~length1~0 < 1); 916#L532-2 assume !(main_~length2~0 < 1); 909#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 910#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 924#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 925#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 904#L541-4 main_~i~1 := 0; 905#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 911#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 912#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 913#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 906#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 908#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 922#L522-5 [2019-11-28 03:53:17,557 INFO L796 eck$LassoCheckResult]: Loop: 922#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 917#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 918#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 922#L522-5 [2019-11-28 03:53:17,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:17,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2019-11-28 03:53:17,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:17,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994503399] [2019-11-28 03:53:17,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:17,578 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:17,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:17,579 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 2 times [2019-11-28 03:53:17,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:17,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009798159] [2019-11-28 03:53:17,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:17,586 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:17,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2019-11-28 03:53:17,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:17,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715056304] [2019-11-28 03:53:17,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:17,613 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:18,467 WARN L192 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 126 [2019-11-28 03:53:18,654 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-28 03:53:18,656 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:18,656 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:18,656 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:18,656 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:18,656 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:18,657 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:18,657 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:18,657 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:18,657 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration8_Lasso [2019-11-28 03:53:18,657 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:18,657 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:18,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,197 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-11-28 03:53:19,379 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-28 03:53:19,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,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 03:53:19,801 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-28 03:53:20,310 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-11-28 03:53:20,495 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:53:20,496 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:20,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:20,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:20,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,555 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:20,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:20,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:20,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:20,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:20,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,607 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:20,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:20,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:20,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:20,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:20,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:20,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,699 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:53:20,700 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-28 03:53:20,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,770 INFO L401 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-11-28 03:53:20,770 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-28 03:53:20,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:20,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:20,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:21,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:21,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:21,029 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:53:21,090 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2019-11-28 03:53:21,090 INFO L444 ModelExtractionUtils]: 8 out of 58 variables were initially zero. Simplification set additionally 47 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:21,095 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:53:21,097 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:53:21,097 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:53:21,098 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_4, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_4 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2019-11-28 03:53:21,240 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-28 03:53:21,243 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:53:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:21,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:53:21,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:21,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:53:21,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:21,338 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 03:53:21,338 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 03:53:21,411 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 51 states and 67 transitions. Complement of second has 7 states. [2019-11-28 03:53:21,413 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 03:53:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:53:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-11-28 03:53:21,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-28 03:53:21,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:21,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-28 03:53:21,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:21,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-28 03:53:21,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:21,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 67 transitions. [2019-11-28 03:53:21,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:53:21,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 38 states and 50 transitions. [2019-11-28 03:53:21,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:53:21,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:53:21,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 50 transitions. [2019-11-28 03:53:21,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:53:21,418 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-11-28 03:53:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 50 transitions. [2019-11-28 03:53:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-11-28 03:53:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 03:53:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-28 03:53:21,421 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-28 03:53:21,421 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-28 03:53:21,421 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:53:21,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-11-28 03:53:21,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:53:21,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:21,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:21,423 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:21,423 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:53:21,423 INFO L794 eck$LassoCheckResult]: Stem: 1182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1175#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1176#L532 assume !(main_~length1~0 < 1); 1177#L532-2 assume !(main_~length2~0 < 1); 1170#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1171#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1185#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1186#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1164#L541-4 main_~i~1 := 0; 1165#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1172#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1173#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1174#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 1166#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1167#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1184#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1180#L522-1 assume !cstrpbrk_#t~short7; 1181#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5; 1160#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 1161#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 1162#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 1163#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1169#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1183#L522-5 [2019-11-28 03:53:21,424 INFO L796 eck$LassoCheckResult]: Loop: 1183#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1178#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1179#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 1183#L522-5 [2019-11-28 03:53:21,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:21,424 INFO L82 PathProgramCache]: Analyzing trace with hash -777149455, now seen corresponding path program 1 times [2019-11-28 03:53:21,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:21,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801195466] [2019-11-28 03:53:21,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 03:53:21,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801195466] [2019-11-28 03:53:21,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:53:21,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 03:53:21,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400576656] [2019-11-28 03:53:21,484 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:53:21,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:21,484 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 3 times [2019-11-28 03:53:21,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:21,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434524962] [2019-11-28 03:53:21,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:21,496 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:21,671 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-28 03:53:21,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:21,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:53:21,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:53:21,673 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-11-28 03:53:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:21,761 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-11-28 03:53:21,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 03:53:21,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. [2019-11-28 03:53:21,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:53:21,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 35 states and 45 transitions. [2019-11-28 03:53:21,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:53:21,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:53:21,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2019-11-28 03:53:21,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:53:21,765 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-28 03:53:21,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2019-11-28 03:53:21,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-28 03:53:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 03:53:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-11-28 03:53:21,775 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 03:53:21,775 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 03:53:21,775 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:53:21,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-11-28 03:53:21,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:53:21,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:21,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:21,777 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:21,778 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:53:21,778 INFO L794 eck$LassoCheckResult]: Stem: 1270#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1263#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1264#L532 assume !(main_~length1~0 < 1); 1265#L532-2 assume !(main_~length2~0 < 1); 1258#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1259#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1274#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1275#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1252#L541-4 main_~i~1 := 0; 1253#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1260#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1261#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1262#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 1254#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1255#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1279#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1280#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1277#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5; 1248#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 1249#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 1250#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 1251#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1257#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1271#L522-5 [2019-11-28 03:53:21,779 INFO L796 eck$LassoCheckResult]: Loop: 1271#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1266#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1267#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 1271#L522-5 [2019-11-28 03:53:21,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:21,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1742810479, now seen corresponding path program 2 times [2019-11-28 03:53:21,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:21,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846555104] [2019-11-28 03:53:21,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:53:22,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846555104] [2019-11-28 03:53:22,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038058331] [2019-11-28 03:53:22,114 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:53:22,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:53:22,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:53:22,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-28 03:53:22,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:22,195 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:53:22,196 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-28 03:53:22,196 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:53:22,223 INFO L588 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-11-28 03:53:22,224 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:53:22,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:24 [2019-11-28 03:53:22,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:53:22,481 INFO L343 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2019-11-28 03:53:22,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2019-11-28 03:53:22,482 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:53:22,500 INFO L343 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2019-11-28 03:53:22,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2019-11-28 03:53:22,501 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:53:22,530 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:53:22,531 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-28 03:53:22,532 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:79 [2019-11-28 03:53:22,654 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:53:22,654 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2019-11-28 03:53:22,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:53:22,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:53:22,658 INFO L508 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 03:53:22,688 INFO L588 ElimStorePlain]: treesize reduction 8, result has 82.6 percent of original size [2019-11-28 03:53:22,692 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:53:22,693 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:53:22,707 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-28 03:53:22,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 03:53:22,708 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:53:22,731 INFO L588 ElimStorePlain]: treesize reduction 8, result has 66.7 percent of original size [2019-11-28 03:53:22,732 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:53:22,732 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:3 [2019-11-28 03:53:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:22,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:53:22,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2019-11-28 03:53:22,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535154969] [2019-11-28 03:53:22,766 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:53:22,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:22,767 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 4 times [2019-11-28 03:53:22,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:22,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156511489] [2019-11-28 03:53:22,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:22,775 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:22,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:22,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 03:53:22,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-11-28 03:53:22,960 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 15 Second operand 19 states. [2019-11-28 03:53:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:24,258 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2019-11-28 03:53:24,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 03:53:24,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 86 transitions. [2019-11-28 03:53:24,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:53:24,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 36 states and 46 transitions. [2019-11-28 03:53:24,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:53:24,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 03:53:24,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2019-11-28 03:53:24,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:53:24,260 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-11-28 03:53:24,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2019-11-28 03:53:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-11-28 03:53:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 03:53:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2019-11-28 03:53:24,263 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-28 03:53:24,263 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-28 03:53:24,263 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:53:24,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2019-11-28 03:53:24,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:53:24,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:24,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:24,265 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:24,265 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:53:24,265 INFO L794 eck$LassoCheckResult]: Stem: 1490#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1483#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1484#L532 assume !(main_~length1~0 < 1); 1485#L532-2 assume !(main_~length2~0 < 1); 1478#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1479#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1494#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1495#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1497#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1498#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1472#L541-4 main_~i~1 := 0; 1473#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1480#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1481#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1482#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 1474#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1475#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1493#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1488#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1489#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5; 1468#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 1469#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 1470#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 1471#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1477#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1491#L522-5 [2019-11-28 03:53:24,265 INFO L796 eck$LassoCheckResult]: Loop: 1491#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1486#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1487#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 1491#L522-5 [2019-11-28 03:53:24,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:24,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1365761455, now seen corresponding path program 3 times [2019-11-28 03:53:24,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:24,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436798882] [2019-11-28 03:53:24,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:24,296 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:24,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:24,297 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 5 times [2019-11-28 03:53:24,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:24,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457728347] [2019-11-28 03:53:24,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:24,304 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:24,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:24,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1174254192, now seen corresponding path program 1 times [2019-11-28 03:53:24,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:24,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853025282] [2019-11-28 03:53:24,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:24,344 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:26,176 WARN L192 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 228 DAG size of output: 179 [2019-11-28 03:53:29,017 WARN L192 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 138 DAG size of output: 138 [2019-11-28 03:53:29,021 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:29,021 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:29,021 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:29,021 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:29,021 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:29,022 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:29,022 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:29,022 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:29,022 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration11_Lasso [2019-11-28 03:53:29,022 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:29,022 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:29,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:29,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:29,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:29,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:29,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:29,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:29,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:29,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:29,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:29,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:29,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:29,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:29,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:29,489 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-28 03:53:30,806 WARN L192 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 135 DAG size of output: 113 [2019-11-28 03:53:31,056 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-28 03:53:31,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:31,334 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-28 03:53:31,695 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-28 03:53:32,294 WARN L192 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-11-28 03:53:32,587 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-11-28 03:53:32,802 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-28 03:53:32,882 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:53:32,883 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:32,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:32,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:32,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:32,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:32,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:32,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:32,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:32,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:32,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:32,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:32,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:32,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:32,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:32,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:32,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:32,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:32,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:32,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:32,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:32,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:32,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:32,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:32,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:32,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:32,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:32,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:32,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:32,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:32,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:32,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:32,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:32,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:32,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:32,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:32,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:32,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:32,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:32,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:32,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:32,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:32,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:32,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:32,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:32,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:32,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:32,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:32,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:32,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:32,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:32,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:32,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:32,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:32,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:32,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:32,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:32,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:32,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:32,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:32,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:32,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:32,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:32,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:32,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:32,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:32,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:32,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:32,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:32,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:32,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:32,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:32,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:32,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:32,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:32,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:32,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:32,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:32,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:32,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:32,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:32,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:32,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:32,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:32,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:32,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:32,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:32,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:32,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:32,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:32,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:32,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:32,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:32,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:32,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:32,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:32,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:32,992 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:33,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 03:53:33,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:33,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:33,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:33,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:33,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:33,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:33,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:33,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:33,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:33,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:33,014 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-28 03:53:33,015 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-28 03:53:33,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:33,113 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-11-28 03:53:33,114 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-28 03:53:33,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:33,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:33,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:33,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:33,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:33,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:33,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:33,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:33,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:33,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:33,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:33,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:33,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:33,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:33,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:33,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:33,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:33,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:33,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:33,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:33,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:33,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:33,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:33,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:33,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:33,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:33,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:33,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:33,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:33,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:33,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:33,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:33,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:33,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:33,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:33,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:33,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:33,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:33,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:33,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:33,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:33,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:33,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:33,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:33,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:33,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:33,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:33,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:33,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 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:33,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:53:33,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:33,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:33,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:33,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:33,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:33,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:33,644 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:53:33,824 INFO L443 ModelExtractionUtils]: Simplification made 33 calls to the SMT solver. [2019-11-28 03:53:33,824 INFO L444 ModelExtractionUtils]: 22 out of 61 variables were initially zero. Simplification set additionally 36 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:33,829 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:33,832 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:53:33,832 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:53:33,832 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_5, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_5 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2019-11-28 03:53:34,076 INFO L297 tatePredicateManager]: 41 out of 42 supporting invariants were superfluous and have been removed [2019-11-28 03:53:34,079 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:53:34,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:34,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:53:34,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:34,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:53:34,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:34,179 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 03:53:34,180 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 03:53:34,180 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-28 03:53:34,248 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 51 states and 63 transitions. Complement of second has 7 states. [2019-11-28 03:53:34,248 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 03:53:34,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:53:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-11-28 03:53:34,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 03:53:34,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:34,250 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:53:34,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:34,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:53:34,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:34,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:53:34,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:34,364 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 03:53:34,364 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-28 03:53:34,365 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-28 03:53:34,441 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 51 states and 63 transitions. Complement of second has 7 states. [2019-11-28 03:53:34,442 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 03:53:34,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:53:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-11-28 03:53:34,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 03:53:34,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:34,443 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:53:34,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:34,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:53:34,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:34,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:53:34,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:34,552 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 03:53:34,553 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-28 03:53:34,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-28 03:53:34,621 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 51 states and 65 transitions. Complement of second has 6 states. [2019-11-28 03:53:34,622 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 03:53:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:53:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2019-11-28 03:53:34,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 03:53:34,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:34,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-28 03:53:34,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:34,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-28 03:53:34,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:34,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2019-11-28 03:53:34,628 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:53:34,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 0 states and 0 transitions. [2019-11-28 03:53:34,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:53:34,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:53:34,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:53:34,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:34,629 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:53:34,629 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:53:34,629 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:53:34,630 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 03:53:34,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:53:34,630 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:53:34,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:53:34,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:53:34 BoogieIcfgContainer [2019-11-28 03:53:34,677 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:53:34,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:53:34,680 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:53:34,680 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:53:34,681 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:53:06" (3/4) ... [2019-11-28 03:53:34,686 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:53:34,686 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:53:34,690 INFO L168 Benchmark]: Toolchain (without parser) took 29247.11 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 524.3 MB). Free memory was 955.0 MB in the beginning and 1.5 GB in the end (delta: -554.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:53:34,691 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:53:34,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:34,693 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:34,693 INFO L168 Benchmark]: Boogie Preprocessor took 32.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:53:34,694 INFO L168 Benchmark]: RCFGBuilder took 456.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:34,694 INFO L168 Benchmark]: BuchiAutomizer took 28083.43 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 405.8 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -441.9 MB). Peak memory consumption was 626.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:34,695 INFO L168 Benchmark]: Witness Printer took 8.71 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:34,699 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 605.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 456.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28083.43 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 405.8 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -441.9 MB). Peak memory consumption was 626.6 MB. Max. memory is 11.5 GB. * Witness Printer took 8.71 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function -1 * sc1 + length1 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.9s and 12 iterations. TraceHistogramMax:2. Analysis of lassos took 24.3s. Construction of modules took 0.8s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 28 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 10. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 238 SDtfs, 697 SDslu, 605 SDs, 0 SdLazy, 657 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital410 mio100 ax107 hnf98 lsp82 ukn67 mio100 lsp44 div106 bol100 ite100 ukn100 eq179 hnf88 smp96 dnf338 smp60 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 453ms VariablesStem: 9 VariablesLoop: 6 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...