./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/cstrcpy-alloca-1.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 83897956e392064e8b9522b11a8bf4c25fb2a6e3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:25:28,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:25:28,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:25:28,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:25:28,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:25:28,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:25:28,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:25:28,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:25:28,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:25:28,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:25:28,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:25:28,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:25:28,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:25:28,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:25:28,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:25:28,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:25:28,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:25:28,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:25:28,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:25:28,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:25:28,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:25:28,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:25:28,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:25:28,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:25:28,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:25:28,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:25:28,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:25:28,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:25:28,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:25:28,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:25:28,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:25:28,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:25:28,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:25:28,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:25:28,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:25:28,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:25:28,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:25:28,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:25:28,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:25:28,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:25:28,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:25:28,986 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:25:29,013 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:25:29,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:25:29,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:25:29,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:25:29,017 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:25:29,017 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:25:29,017 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:25:29,018 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:25:29,018 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:25:29,018 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:25:29,020 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:25:29,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:25:29,020 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:25:29,021 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:25:29,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:25:29,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:25:29,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:25:29,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:25:29,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:25:29,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:25:29,023 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:25:29,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:25:29,024 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:25:29,024 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:25:29,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:25:29,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:25:29,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:25:29,025 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:25:29,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:25:29,026 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:25:29,026 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:25:29,027 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:25:29,029 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:25:29,029 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 -> 83897956e392064e8b9522b11a8bf4c25fb2a6e3 [2020-07-29 03:25:29,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:25:29,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:25:29,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:25:29,378 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:25:29,379 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:25:29,380 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2020-07-29 03:25:29,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a806cba/3dbccf264f524c1b8074b297aa285b2a/FLAGf734ad205 [2020-07-29 03:25:29,999 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:25:30,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2020-07-29 03:25:30,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a806cba/3dbccf264f524c1b8074b297aa285b2a/FLAGf734ad205 [2020-07-29 03:25:30,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a806cba/3dbccf264f524c1b8074b297aa285b2a [2020-07-29 03:25:30,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:25:30,351 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:25:30,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:30,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:25:30,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:25:30,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:30" (1/1) ... [2020-07-29 03:25:30,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670d1462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:30, skipping insertion in model container [2020-07-29 03:25:30,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:30" (1/1) ... [2020-07-29 03:25:30,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:25:30,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:25:30,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:30,899 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:25:30,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:31,007 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:25:31,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:31 WrapperNode [2020-07-29 03:25:31,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:31,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:31,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:25:31,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:25:31,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:31" (1/1) ... [2020-07-29 03:25:31,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:31" (1/1) ... [2020-07-29 03:25:31,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:31,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:25:31,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:25:31,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:25:31,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:31" (1/1) ... [2020-07-29 03:25:31,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:31" (1/1) ... [2020-07-29 03:25:31,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:31" (1/1) ... [2020-07-29 03:25:31,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:31" (1/1) ... [2020-07-29 03:25:31,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:31" (1/1) ... [2020-07-29 03:25:31,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:31" (1/1) ... [2020-07-29 03:25:31,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:31" (1/1) ... [2020-07-29 03:25:31,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:25:31,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:25:31,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:25:31,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:25:31,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:31" (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 [2020-07-29 03:25:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:25:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:25:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:25:31,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:25:31,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:25:31,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:25:31,580 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:25:31,581 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 03:25:31,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:31 BoogieIcfgContainer [2020-07-29 03:25:31,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:25:31,585 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:25:31,586 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:25:31,592 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:25:31,593 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:31,593 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:25:30" (1/3) ... [2020-07-29 03:25:31,595 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@702f0522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:31, skipping insertion in model container [2020-07-29 03:25:31,595 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:31,595 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:31" (2/3) ... [2020-07-29 03:25:31,596 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@702f0522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:31, skipping insertion in model container [2020-07-29 03:25:31,596 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:31,596 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:31" (3/3) ... [2020-07-29 03:25:31,598 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcpy-alloca-1.i [2020-07-29 03:25:31,653 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:25:31,653 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:25:31,653 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:25:31,653 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:25:31,654 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:25:31,654 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:25:31,654 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:25:31,654 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:25:31,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 03:25:31,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:31,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:31,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:31,697 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:25:31,697 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:31,697 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:25:31,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 03:25:31,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:31,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:31,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:31,701 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:25:31,701 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:31,708 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 4#L525true assume !(main_~length1~0 < 1); 6#L525-2true assume !(main_~length2~0 < 1); 17#L528-1true assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 9#L535-3true [2020-07-29 03:25:31,709 INFO L796 eck$LassoCheckResult]: Loop: 9#L535-3true assume !!(main_~i~0 < main_~length2~0 - 1);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 7#L535-2true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 9#L535-3true [2020-07-29 03:25:31,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:31,716 INFO L82 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2020-07-29 03:25:31,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:31,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269638413] [2020-07-29 03:25:31,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,832 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,876 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:31,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:31,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2020-07-29 03:25:31,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:31,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422905531] [2020-07-29 03:25:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,891 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,900 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,904 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:31,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:31,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939692, now seen corresponding path program 1 times [2020-07-29 03:25:31,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:31,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362198258] [2020-07-29 03:25:31,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,937 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,960 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,970 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:32,306 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-07-29 03:25:32,427 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:32,428 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:32,428 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:32,429 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:32,429 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:32,429 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:32,429 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:32,429 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:32,430 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcpy-alloca-1.i_Iteration1_Lasso [2020-07-29 03:25:32,430 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:32,430 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:32,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:32,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:32,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:32,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:32,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:32,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:32,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:32,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:32,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:32,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:32,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:32,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:32,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,439 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:33,445 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) [2020-07-29 03:25:33,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:33,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:33,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:33,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:33,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:33,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:33,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:33,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:33,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:33,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:33,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:33,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:33,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:33,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:33,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:33,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:33,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:33,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:33,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:33,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:33,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:33,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:33,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:33,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:33,560 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 [2020-07-29 03:25: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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:33,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:33,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:33,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:33,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:33,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:33,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:33,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:33,602 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 [2020-07-29 03:25:33,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:33,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:33,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:33,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:33,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:33,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:33,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:33,646 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 [2020-07-29 03:25:33,651 INFO L522 LassoAnalysis]: Proving 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) [2020-07-29 03:25:33,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 [2020-07-29 03:25:33,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:33,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:33,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:33,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:33,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:33,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:33,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:33,693 INFO L522 LassoAnalysis]: Proving 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) [2020-07-29 03:25:33,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:33,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:33,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:33,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:33,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:33,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:33,744 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 [2020-07-29 03:25:33,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:33,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:33,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:33,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:33,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:33,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:33,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:33,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:33,795 INFO L522 LassoAnalysis]: Proving 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) [2020-07-29 03:25:33,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:33,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:33,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:33,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:33,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:33,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:33,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:33,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:33,835 INFO L522 LassoAnalysis]: Proving 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) [2020-07-29 03:25:33,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:33,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:33,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:33,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:33,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:33,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:33,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:33,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:33,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 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:33,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:33,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:33,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:33,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:33,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:33,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:33,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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:33,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:34,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:34,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,072 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:34,273 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2020-07-29 03:25:34,274 INFO L444 ModelExtractionUtils]: 6 out of 28 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:34,297 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:34,297 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:34,298 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2020-07-29 03:25:34,357 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:25:34,361 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length2~0 - 1);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10;" "main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9;" [2020-07-29 03:25:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:34,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:34,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:34,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:34,442 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {25#unseeded} is VALID [2020-07-29 03:25:34,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#unseeded} havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; {25#unseeded} is VALID [2020-07-29 03:25:34,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {25#unseeded} assume !(main_~length1~0 < 1); {25#unseeded} is VALID [2020-07-29 03:25:34,445 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#unseeded} assume !(main_~length2~0 < 1); {25#unseeded} is VALID [2020-07-29 03:25:34,445 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#unseeded} assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; {25#unseeded} is VALID [2020-07-29 03:25:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:34,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:34,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:34,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~length2~0))} assume !!(main_~i~0 < main_~length2~0 - 1);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; {85#(and (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~length2~0 (+ oldRank0 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 03:25:34,476 INFO L280 TraceCheckUtils]: 1: Hoare triple {85#(and (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~length2~0 (+ oldRank0 ULTIMATE.start_main_~i~0)))} main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; {68#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~length2~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:34,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:34,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:34,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:34,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,511 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 [2020-07-29 03:25:34,512 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2020-07-29 03:25:34,626 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 36 states and 47 transitions. Complement of second has 7 states. [2020-07-29 03:25:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:34,626 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:34,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 03:25:34,631 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:34,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:34,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:34,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:34,642 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:34,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:34,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:34,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2020-07-29 03:25:34,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:34,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:34,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:34,655 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states. [2020-07-29 03:25:34,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:34,661 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:34,661 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:34,667 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:34,667 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:34,668 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 47 transitions. cyclomatic complexity: 15 [2020-07-29 03:25:34,668 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:34,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:34,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:34,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:34,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:34,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:34,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:34,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:34,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:34,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:34,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 36 letters. Loop has 36 letters. [2020-07-29 03:25:34,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 36 letters. Loop has 36 letters. [2020-07-29 03:25:34,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 15 Stem has 36 letters. Loop has 36 letters. [2020-07-29 03:25:34,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:25:34,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:25:34,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:25:34,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:34,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:34,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:34,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:34,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:34,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:34,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:34,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:34,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:34,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:34,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:34,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:34,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:34,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:34,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:34,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:34,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:34,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:34,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:34,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:34,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:34,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:34,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:34,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:34,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:34,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:34,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:34,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,693 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-29 03:25:34,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:34,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:34,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:25:34,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:34,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. cyclomatic complexity: 15 [2020-07-29 03:25:34,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:34,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 11 states and 15 transitions. [2020-07-29 03:25:34,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 03:25:34,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 03:25:34,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2020-07-29 03:25:34,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:34,739 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-07-29 03:25:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2020-07-29 03:25:34,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 03:25:34,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:34,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 15 transitions. Second operand 11 states. [2020-07-29 03:25:34,773 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 15 transitions. Second operand 11 states. [2020-07-29 03:25:34,775 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 11 states. [2020-07-29 03:25:34,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:34,780 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2020-07-29 03:25:34,780 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2020-07-29 03:25:34,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:34,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:34,781 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 15 transitions. [2020-07-29 03:25:34,782 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 15 transitions. [2020-07-29 03:25:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:34,784 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2020-07-29 03:25:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2020-07-29 03:25:34,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:34,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:34,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:34,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 03:25:34,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2020-07-29 03:25:34,797 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-07-29 03:25:34,797 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-07-29 03:25:34,797 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:25:34,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2020-07-29 03:25:34,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:34,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:34,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:34,801 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:34,801 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:34,801 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 139#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 140#L525 assume !(main_~length1~0 < 1); 144#L525-2 assume !(main_~length2~0 < 1); 145#L528-1 assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 135#L535-3 assume !(main_~i~0 < main_~length2~0 - 1); 136#L535-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset, cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstrcpy_#res.base, cstrcpy_#res.offset;havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, cstrcpy_#t~mem4, cstrcpy_~s1.base, cstrcpy_~s1.offset, cstrcpy_~s2.base, cstrcpy_~s2.offset, cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset, cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~s1.base, cstrcpy_~s1.offset := cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset;cstrcpy_~s2.base, cstrcpy_~s2.offset := cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_~s1.base, cstrcpy_~s1.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_~s2.base, cstrcpy_~s2.offset; 141#L518-3 [2020-07-29 03:25:34,801 INFO L796 eck$LassoCheckResult]: Loop: 141#L518-3 cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset := cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_#t~post2.base, 1 + cstrcpy_#t~post2.offset;cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset := cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_#t~post3.base, 1 + cstrcpy_#t~post3.offset;call cstrcpy_#t~mem4 := read~int(cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, 1);call write~int(cstrcpy_#t~mem4, cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, 1); 142#L518-1 assume !!(0 != cstrcpy_#t~mem4);havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset;havoc cstrcpy_#t~mem4;havoc cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset; 141#L518-3 [2020-07-29 03:25:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:34,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939634, now seen corresponding path program 1 times [2020-07-29 03:25:34,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:34,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059273440] [2020-07-29 03:25:34,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:34,846 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:34,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:34,887 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:34,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2182, now seen corresponding path program 1 times [2020-07-29 03:25:34,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:34,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870697810] [2020-07-29 03:25:34,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:34,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:34,917 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:34,925 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:34,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1302201911, now seen corresponding path program 1 times [2020-07-29 03:25:34,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:34,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175115215] [2020-07-29 03:25:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {175#true} is VALID [2020-07-29 03:25:35,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {175#true} havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; {175#true} is VALID [2020-07-29 03:25:35,140 INFO L280 TraceCheckUtils]: 2: Hoare triple {175#true} assume !(main_~length1~0 < 1); {175#true} is VALID [2020-07-29 03:25:35,141 INFO L280 TraceCheckUtils]: 3: Hoare triple {175#true} assume !(main_~length2~0 < 1); {177#(<= 1 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:25:35,142 INFO L280 TraceCheckUtils]: 4: Hoare triple {177#(<= 1 ULTIMATE.start_main_~length2~0)} assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; {178#(and (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset)) (= 0 ULTIMATE.start_main_~nondetString~0.offset))} is VALID [2020-07-29 03:25:35,143 INFO L280 TraceCheckUtils]: 5: Hoare triple {178#(and (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset)) (= 0 ULTIMATE.start_main_~nondetString~0.offset))} assume !(main_~i~0 < main_~length2~0 - 1); {179#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset)) (<= ULTIMATE.start_main_~length2~0 1) (= 0 ULTIMATE.start_main_~nondetString~0.offset))} is VALID [2020-07-29 03:25:35,145 INFO L280 TraceCheckUtils]: 6: Hoare triple {179#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset)) (<= ULTIMATE.start_main_~length2~0 1) (= 0 ULTIMATE.start_main_~nondetString~0.offset))} call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset, cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstrcpy_#res.base, cstrcpy_#res.offset;havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, cstrcpy_#t~mem4, cstrcpy_~s1.base, cstrcpy_~s1.offset, cstrcpy_~s2.base, cstrcpy_~s2.offset, cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset, cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~s1.base, cstrcpy_~s1.offset := cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset;cstrcpy_~s2.base, cstrcpy_~s2.offset := cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_~s1.base, cstrcpy_~s1.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_~s2.base, cstrcpy_~s2.offset; {180#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcpy_~src~0.base) ULTIMATE.start_cstrcpy_~src~0.offset))} is VALID [2020-07-29 03:25:35,146 INFO L280 TraceCheckUtils]: 7: Hoare triple {180#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcpy_~src~0.base) ULTIMATE.start_cstrcpy_~src~0.offset))} cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset := cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_#t~post2.base, 1 + cstrcpy_#t~post2.offset;cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset := cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_#t~post3.base, 1 + cstrcpy_#t~post3.offset;call cstrcpy_#t~mem4 := read~int(cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, 1);call write~int(cstrcpy_#t~mem4, cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, 1); {181#(= 0 |ULTIMATE.start_cstrcpy_#t~mem4|)} is VALID [2020-07-29 03:25:35,147 INFO L280 TraceCheckUtils]: 8: Hoare triple {181#(= 0 |ULTIMATE.start_cstrcpy_#t~mem4|)} assume !!(0 != cstrcpy_#t~mem4);havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset;havoc cstrcpy_#t~mem4;havoc cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset; {176#false} is VALID [2020-07-29 03:25:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:35,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175115215] [2020-07-29 03:25:35,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:35,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 03:25:35,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85361179] [2020-07-29 03:25:35,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:35,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 03:25:35,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-29 03:25:35,255 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-07-29 03:25:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:35,443 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-07-29 03:25:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:25:35,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:25:35,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:35,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2020-07-29 03:25:35,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:35,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 15 transitions. [2020-07-29 03:25:35,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 03:25:35,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 03:25:35,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2020-07-29 03:25:35,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:35,461 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-29 03:25:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2020-07-29 03:25:35,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-07-29 03:25:35,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:35,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 15 transitions. Second operand 11 states. [2020-07-29 03:25:35,463 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 15 transitions. Second operand 11 states. [2020-07-29 03:25:35,463 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 11 states. [2020-07-29 03:25:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:35,464 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2020-07-29 03:25:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-07-29 03:25:35,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:35,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:35,465 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 12 states and 15 transitions. [2020-07-29 03:25:35,466 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 12 states and 15 transitions. [2020-07-29 03:25:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:35,467 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2020-07-29 03:25:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-07-29 03:25:35,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:35,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:35,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:35,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 03:25:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-07-29 03:25:35,469 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 03:25:35,469 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 03:25:35,469 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:25:35,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-07-29 03:25:35,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:35,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,471 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:35,471 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:35,471 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 207#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 208#L525 assume !(main_~length1~0 < 1); 212#L525-2 assume !(main_~length2~0 < 1); 213#L528-1 assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 203#L535-3 assume !!(main_~i~0 < main_~length2~0 - 1);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 204#L535-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 205#L535-3 assume !(main_~i~0 < main_~length2~0 - 1); 206#L535-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset, cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstrcpy_#res.base, cstrcpy_#res.offset;havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, cstrcpy_#t~mem4, cstrcpy_~s1.base, cstrcpy_~s1.offset, cstrcpy_~s2.base, cstrcpy_~s2.offset, cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset, cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~s1.base, cstrcpy_~s1.offset := cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset;cstrcpy_~s2.base, cstrcpy_~s2.offset := cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_~s1.base, cstrcpy_~s1.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_~s2.base, cstrcpy_~s2.offset; 210#L518-3 [2020-07-29 03:25:35,472 INFO L796 eck$LassoCheckResult]: Loop: 210#L518-3 cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset := cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_#t~post2.base, 1 + cstrcpy_#t~post2.offset;cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset := cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_#t~post3.base, 1 + cstrcpy_#t~post3.offset;call cstrcpy_#t~mem4 := read~int(cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, 1);call write~int(cstrcpy_#t~mem4, cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, 1); 211#L518-1 assume !!(0 != cstrcpy_#t~mem4);havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset;havoc cstrcpy_#t~mem4;havoc cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset; 210#L518-3 [2020-07-29 03:25:35,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1302257236, now seen corresponding path program 1 times [2020-07-29 03:25:35,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:35,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269771487] [2020-07-29 03:25:35,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,502 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,508 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:35,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2182, now seen corresponding path program 2 times [2020-07-29 03:25:35,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:35,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886886415] [2020-07-29 03:25:35,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,519 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,522 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:35,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1633721881, now seen corresponding path program 1 times [2020-07-29 03:25:35,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:35,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565362695] [2020-07-29 03:25:35,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,567 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:36,045 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 98 [2020-07-29 03:25:36,290 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-07-29 03:25:36,293 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:36,293 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:36,293 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:36,293 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:36,293 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:36,294 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:36,294 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:36,294 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:36,294 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcpy-alloca-1.i_Iteration3_Lasso [2020-07-29 03:25:36,294 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:36,294 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:36,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,740 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2020-07-29 03:25:36,905 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-07-29 03:25:36,908 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:36,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:37,439 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-07-29 03:25:38,082 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:38,083 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,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 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,125 INFO L522 LassoAnalysis]: Proving 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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,198 INFO L522 LassoAnalysis]: Proving 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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:38,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:38,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:38,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:38,307 INFO L522 LassoAnalysis]: Proving 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) [2020-07-29 03:25:38,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,344 INFO L522 LassoAnalysis]: Proving 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) [2020-07-29 03:25:38,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,480 INFO L522 LassoAnalysis]: Proving 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 [2020-07-29 03:25:38,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:38,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:38,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2020-07-29 03:25:38,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2020-07-29 03:25:38,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,578 INFO L522 LassoAnalysis]: Proving 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 [2020-07-29 03:25:38,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:38,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:38,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:38,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:38,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:38,644 INFO L522 LassoAnalysis]: Proving 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 [2020-07-29 03:25:38,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,669 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:25:38,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,671 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 03:25:38,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,673 INFO L522 LassoAnalysis]: Proving 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 [2020-07-29 03:25:38,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:38,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:38,754 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:38,805 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 03:25:38,805 INFO L444 ModelExtractionUtils]: 31 out of 43 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,811 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:38,814 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:38,815 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:38,815 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcpy_~src~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_2) = -1*ULTIMATE.start_cstrcpy_~src~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_2 Supporting invariants [] [2020-07-29 03:25:38,897 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2020-07-29 03:25:38,903 INFO L393 LassoCheck]: Loop: "cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset := cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_#t~post2.base, 1 + cstrcpy_#t~post2.offset;cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset := cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_#t~post3.base, 1 + cstrcpy_#t~post3.offset;call cstrcpy_#t~mem4 := read~int(cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, 1);call write~int(cstrcpy_#t~mem4, cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, 1);" "assume !!(0 != cstrcpy_#t~mem4);havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset;havoc cstrcpy_#t~mem4;havoc cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset;" [2020-07-29 03:25:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,910 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:25:38,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:25:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:38,996 INFO L280 TraceCheckUtils]: 0: Hoare triple {247#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {247#unseeded} is VALID [2020-07-29 03:25:38,996 INFO L280 TraceCheckUtils]: 1: Hoare triple {247#unseeded} havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; {247#unseeded} is VALID [2020-07-29 03:25:38,997 INFO L280 TraceCheckUtils]: 2: Hoare triple {247#unseeded} assume !(main_~length1~0 < 1); {247#unseeded} is VALID [2020-07-29 03:25:38,997 INFO L280 TraceCheckUtils]: 3: Hoare triple {247#unseeded} assume !(main_~length2~0 < 1); {247#unseeded} is VALID [2020-07-29 03:25:38,998 INFO L280 TraceCheckUtils]: 4: Hoare triple {247#unseeded} assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; {337#(and (= ULTIMATE.start_main_~nondetString~0.base |ULTIMATE.start_main_#t~malloc8.base|) unseeded)} is VALID [2020-07-29 03:25:38,999 INFO L280 TraceCheckUtils]: 5: Hoare triple {337#(and (= ULTIMATE.start_main_~nondetString~0.base |ULTIMATE.start_main_#t~malloc8.base|) unseeded)} assume !!(main_~i~0 < main_~length2~0 - 1);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; {337#(and (= ULTIMATE.start_main_~nondetString~0.base |ULTIMATE.start_main_#t~malloc8.base|) unseeded)} is VALID [2020-07-29 03:25:39,000 INFO L280 TraceCheckUtils]: 6: Hoare triple {337#(and (= ULTIMATE.start_main_~nondetString~0.base |ULTIMATE.start_main_#t~malloc8.base|) unseeded)} main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; {337#(and (= ULTIMATE.start_main_~nondetString~0.base |ULTIMATE.start_main_#t~malloc8.base|) unseeded)} is VALID [2020-07-29 03:25:39,001 INFO L280 TraceCheckUtils]: 7: Hoare triple {337#(and (= ULTIMATE.start_main_~nondetString~0.base |ULTIMATE.start_main_#t~malloc8.base|) unseeded)} assume !(main_~i~0 < main_~length2~0 - 1); {337#(and (= ULTIMATE.start_main_~nondetString~0.base |ULTIMATE.start_main_#t~malloc8.base|) unseeded)} is VALID [2020-07-29 03:25:39,002 INFO L280 TraceCheckUtils]: 8: Hoare triple {337#(and (= ULTIMATE.start_main_~nondetString~0.base |ULTIMATE.start_main_#t~malloc8.base|) unseeded)} call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset, cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstrcpy_#res.base, cstrcpy_#res.offset;havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, cstrcpy_#t~mem4, cstrcpy_~s1.base, cstrcpy_~s1.offset, cstrcpy_~s2.base, cstrcpy_~s2.offset, cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset, cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~s1.base, cstrcpy_~s1.offset := cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset;cstrcpy_~s2.base, cstrcpy_~s2.offset := cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_~s1.base, cstrcpy_~s1.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_~s2.base, cstrcpy_~s2.offset; {316#(and (= ULTIMATE.start_cstrcpy_~src~0.base |ULTIMATE.start_main_#t~malloc8.base|) unseeded)} is VALID [2020-07-29 03:25:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:39,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 03:25:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:39,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:39,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {317#(and (= ULTIMATE.start_cstrcpy_~src~0.base |ULTIMATE.start_main_#t~malloc8.base|) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrcpy_~src~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc8.base|))))} cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset := cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_#t~post2.base, 1 + cstrcpy_#t~post2.offset;cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset := cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_#t~post3.base, 1 + cstrcpy_#t~post3.offset;call cstrcpy_#t~mem4 := read~int(cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, 1);call write~int(cstrcpy_#t~mem4, cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, 1); {350#(and (<= 1 oldRank0) (= ULTIMATE.start_cstrcpy_~src~0.base |ULTIMATE.start_main_#t~malloc8.base|) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) 1) (+ ULTIMATE.start_cstrcpy_~src~0.offset oldRank0)))} is VALID [2020-07-29 03:25:39,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {350#(and (<= 1 oldRank0) (= ULTIMATE.start_cstrcpy_~src~0.base |ULTIMATE.start_main_#t~malloc8.base|) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) 1) (+ ULTIMATE.start_cstrcpy_~src~0.offset oldRank0)))} assume !!(0 != cstrcpy_#t~mem4);havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset;havoc cstrcpy_#t~mem4;havoc cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset; {319#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrcpy_~src~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc8.base|)))) unseeded) (= ULTIMATE.start_cstrcpy_~src~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:25:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:39,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:39,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:39,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:39,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,154 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 [2020-07-29 03:25:39,154 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-07-29 03:25:39,210 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2020-07-29 03:25:39,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:39,211 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:39,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2020-07-29 03:25:39,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:39,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:39,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:25:39,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:39,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:39,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:39,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2020-07-29 03:25:39,214 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:39,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:39,214 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2020-07-29 03:25:39,215 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:39,215 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:25:39,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:39,217 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:39,217 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2020-07-29 03:25:39,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2020-07-29 03:25:39,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:39,217 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:25:39,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:39,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:39,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:39,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:39,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:39,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:39,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:25:39,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:25:39,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:25:39,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2020-07-29 03:25:39,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 03:25:39,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2020-07-29 03:25:39,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:39,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:39,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:39,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:39,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:39,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:39,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:39,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:39,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:39,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:39,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:39,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:39,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,225 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:25:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 03:25:39,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:39,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:39,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:39,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2020-07-29 03:25:39,228 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:39,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2020-07-29 03:25:39,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:25:39,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:25:39,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:25:39,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:39,229 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:39,229 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:39,229 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:39,229 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:25:39,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:25:39,230 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:39,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:39,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:25:39 BoogieIcfgContainer [2020-07-29 03:25:39,238 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:25:39,238 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:25:39,238 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:25:39,239 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:25:39,239 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:31" (3/4) ... [2020-07-29 03:25:39,243 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:25:39,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:25:39,246 INFO L168 Benchmark]: Toolchain (without parser) took 8896.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.4 MB). Free memory was 956.2 MB in the beginning and 906.8 MB in the end (delta: 49.4 MB). Peak memory consumption was 359.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:39,247 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:39,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:39,253 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:39,254 INFO L168 Benchmark]: Boogie Preprocessor took 30.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:39,259 INFO L168 Benchmark]: RCFGBuilder took 492.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:39,260 INFO L168 Benchmark]: BuchiAutomizer took 7652.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 906.8 MB in the end (delta: 168.3 MB). Peak memory consumption was 353.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:39,261 INFO L168 Benchmark]: Witness Printer took 5.27 ms. Allocated memory is still 1.3 GB. Free memory is still 906.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:39,268 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 655.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 492.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7652.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 906.8 MB in the end (delta: 168.3 MB). Peak memory consumption was 353.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.27 ms. Allocated memory is still 1.3 GB. Free memory is still 906.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + length2 and consists of 5 locations. One deterministic module has affine ranking function -1 * src + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 6.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 44 SDslu, 40 SDs, 0 SdLazy, 46 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital170 mio100 ax111 hnf98 lsp84 ukn81 mio100 lsp52 div100 bol100 ite100 ukn100 eq179 hnf89 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...