./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.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 8e5b411c800020cce3512b5f08fad6ae7c3970bd ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:19:16,402 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:19:16,404 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:19:16,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:19:16,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:19:16,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:19:16,418 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:19:16,420 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:19:16,422 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:19:16,422 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:19:16,423 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:19:16,424 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:19:16,424 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:19:16,425 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:19:16,426 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:19:16,427 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:19:16,428 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:19:16,430 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:19:16,432 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:19:16,434 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:19:16,435 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:19:16,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:19:16,440 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:19:16,440 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:19:16,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:19:16,441 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:19:16,442 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:19:16,445 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:19:16,446 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:19:16,450 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:19:16,451 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:19:16,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:19:16,452 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:19:16,452 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:19:16,455 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:19:16,456 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:19:16,457 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:19:16,491 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:19:16,492 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:19:16,493 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:19:16,493 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:19:16,493 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:19:16,493 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:19:16,495 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:19:16,495 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:19:16,495 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:19:16,495 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:19:16,496 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:19:16,496 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:19:16,496 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:19:16,496 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:19:16,496 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:19:16,496 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:19:16,499 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:19:16,499 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:19:16,499 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:19:16,499 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:19:16,500 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:19:16,500 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:19:16,500 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:19:16,500 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:19:16,500 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:19:16,501 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:19:16,501 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:19:16,501 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:19:16,501 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:19:16,501 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:19:16,501 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:19:16,502 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:19:16,503 INFO L133 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 -> 8e5b411c800020cce3512b5f08fad6ae7c3970bd [2019-01-02 00:19:16,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:19:16,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:19:16,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:19:16,597 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:19:16,598 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:19:16,598 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:16,664 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d61c7ce/f9a38fa3382b4f6d9f5f33b05373fad6/FLAGf8083b44c [2019-01-02 00:19:17,210 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:19:17,211 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:17,224 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d61c7ce/f9a38fa3382b4f6d9f5f33b05373fad6/FLAGf8083b44c [2019-01-02 00:19:17,519 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d61c7ce/f9a38fa3382b4f6d9f5f33b05373fad6 [2019-01-02 00:19:17,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:19:17,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:19:17,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:19:17,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:19:17,529 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:19:17,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:19:17" (1/1) ... [2019-01-02 00:19:17,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c00a0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:17, skipping insertion in model container [2019-01-02 00:19:17,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:19:17" (1/1) ... [2019-01-02 00:19:17,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:19:17,602 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:19:18,018 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:19:18,034 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:19:18,191 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:19:18,249 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:19:18,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:18 WrapperNode [2019-01-02 00:19:18,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:19:18,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:19:18,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:19:18,251 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:19:18,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:18" (1/1) ... [2019-01-02 00:19:18,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:18" (1/1) ... [2019-01-02 00:19:18,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:19:18,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:19:18,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:19:18,314 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:19:18,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:18" (1/1) ... [2019-01-02 00:19:18,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:18" (1/1) ... [2019-01-02 00:19:18,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:18" (1/1) ... [2019-01-02 00:19:18,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:18" (1/1) ... [2019-01-02 00:19:18,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:18" (1/1) ... [2019-01-02 00:19:18,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:18" (1/1) ... [2019-01-02 00:19:18,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:18" (1/1) ... [2019-01-02 00:19:18,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:19:18,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:19:18,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:19:18,350 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:19:18,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:19:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:19:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:19:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:19:18,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:19:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:19:18,903 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:19:18,903 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-02 00:19:18,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:18 BoogieIcfgContainer [2019-01-02 00:19:18,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:19:18,904 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:19:18,905 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:19:18,909 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:19:18,910 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:18,910 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:19:17" (1/3) ... [2019-01-02 00:19:18,911 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dbbcc16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:19:18, skipping insertion in model container [2019-01-02 00:19:18,911 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:18,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:18" (2/3) ... [2019-01-02 00:19:18,911 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dbbcc16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:19:18, skipping insertion in model container [2019-01-02 00:19:18,911 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:18,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:18" (3/3) ... [2019-01-02 00:19:18,914 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncat-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:18,969 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:19:18,970 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:19:18,970 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:19:18,970 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:19:18,970 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:19:18,970 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:19:18,971 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:19:18,971 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:19:18,971 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:19:18,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-02 00:19:19,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:19:19,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:19,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:19,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:19:19,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:19:19,019 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:19:19,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-02 00:19:19,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:19:19,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:19,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:19,024 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:19:19,024 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:19:19,033 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 4#L557true assume !(main_~length1~0 < 1); 6#L557-2true assume !(main_~length2~0 < 1); 20#L560-1true assume !(main_~n~0 < 1); 12#L563-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post7, cstrncat_#t~post8.base, cstrncat_#t~post8.offset, cstrncat_#t~post4.base, cstrncat_#t~post4.offset, cstrncat_#t~mem5, cstrncat_#t~short6, cstrncat_#t~mem9, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 15#L543-3true [2019-01-02 00:19:19,034 INFO L796 eck$LassoCheckResult]: Loop: 15#L543-3true call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 9#L543-1true assume !!(0 != cstrncat_#t~mem2);havoc cstrncat_#t~mem2;cstrncat_#t~post3.base, cstrncat_#t~post3.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post3.base, 1 + cstrncat_#t~post3.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset; 15#L543-3true [2019-01-02 00:19:19,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:19,041 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-01-02 00:19:19,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:19,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:19,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:19,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:19,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:19,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-01-02 00:19:19,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:19,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:19,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:19,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:19,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:19,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:19,231 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2019-01-02 00:19:19,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:19,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:19,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:19,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:19,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:20,625 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-01-02 00:19:20,777 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-01-02 00:19:20,791 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:20,792 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:20,792 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:20,793 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:20,793 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:20,793 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:20,793 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:20,793 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:20,794 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-02 00:19:20,794 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:20,794 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:20,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:20,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:21,433 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-01-02 00:19:21,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:21,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:21,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:22,629 WARN L181 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-02 00:19:22,829 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:22,835 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:22,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:22,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:22,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:22,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:22,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:22,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:22,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:22,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:22,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:22,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:22,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:22,945 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:19:22,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:22,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:22,955 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:19:22,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:23,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:23,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:23,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:23,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:23,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:23,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:23,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:23,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:23,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:23,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:23,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:23,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:23,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:23,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:23,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:23,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:23,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:23,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:23,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:23,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:23,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:23,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:23,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:23,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:23,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:23,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:23,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:23,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:23,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:23,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:23,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:23,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:23,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:23,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:23,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:23,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:23,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:23,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:23,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:23,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:23,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:23,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:23,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:23,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:23,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:23,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:23,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:23,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:23,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:23,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:23,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:23,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:23,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:23,079 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:19:23,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:23,082 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-02 00:19:23,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:23,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:23,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:23,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:23,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:23,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:23,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:23,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:23,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:23,136 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:23,164 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:19:23,165 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:19:23,168 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:23,170 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:23,170 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:23,171 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1, ULTIMATE.start_cstrncat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2019-01-02 00:19:23,239 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-02 00:19:23,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:19:23,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:23,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:23,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:23,529 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:19:23,530 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-01-02 00:19:23,655 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 53 states and 76 transitions. Complement of second has 7 states. [2019-01-02 00:19:23,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:19:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2019-01-02 00:19:23,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-02 00:19:23,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:23,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-02 00:19:23,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:23,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-02 00:19:23,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:23,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 76 transitions. [2019-01-02 00:19:23,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:23,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 20 states and 27 transitions. [2019-01-02 00:19:23,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-02 00:19:23,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-02 00:19:23,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-01-02 00:19:23,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:23,678 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-01-02 00:19:23,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-01-02 00:19:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-01-02 00:19:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-02 00:19:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-02 00:19:23,704 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-02 00:19:23,704 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-02 00:19:23,704 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:19:23,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-01-02 00:19:23,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:23,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:23,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:23,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:23,707 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:23,707 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 158#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 159#L557 assume !(main_~length1~0 < 1); 164#L557-2 assume !(main_~length2~0 < 1); 174#L560-1 assume !(main_~n~0 < 1); 169#L563-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post7, cstrncat_#t~post8.base, cstrncat_#t~post8.offset, cstrncat_#t~post4.base, cstrncat_#t~post4.offset, cstrncat_#t~mem5, cstrncat_#t~short6, cstrncat_#t~mem9, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 170#L543-3 call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 160#L543-1 assume !(0 != cstrncat_#t~mem2);havoc cstrncat_#t~mem2; 161#L545-4 cstrncat_#t~short6 := 0 != cstrncat_~n; 176#L545 assume !cstrncat_#t~short6; 172#L545-2 assume !!cstrncat_#t~short6;havoc cstrncat_#t~mem5;havoc cstrncat_#t~short6;havoc cstrncat_#t~post4.base, cstrncat_#t~post4.offset;cstrncat_#t~post7 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post7 - 1;havoc cstrncat_#t~post7;cstrncat_#t~post8.base, cstrncat_#t~post8.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post8.base, 1 + cstrncat_#t~post8.offset;havoc cstrncat_#t~post8.base, cstrncat_#t~post8.offset; 175#L545-4 cstrncat_#t~short6 := 0 != cstrncat_~n; 166#L545 [2019-01-02 00:19:23,707 INFO L796 eck$LassoCheckResult]: Loop: 166#L545 assume !cstrncat_#t~short6; 171#L545-2 assume !!cstrncat_#t~short6;havoc cstrncat_#t~mem5;havoc cstrncat_#t~short6;havoc cstrncat_#t~post4.base, cstrncat_#t~post4.offset;cstrncat_#t~post7 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post7 - 1;havoc cstrncat_#t~post7;cstrncat_#t~post8.base, cstrncat_#t~post8.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post8.base, 1 + cstrncat_#t~post8.offset;havoc cstrncat_#t~post8.base, cstrncat_#t~post8.offset; 165#L545-4 cstrncat_#t~short6 := 0 != cstrncat_~n; 166#L545 [2019-01-02 00:19:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:23,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2019-01-02 00:19:23,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:23,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:23,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:23,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:23,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:23,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:19:23,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:19:23,819 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:19:23,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:23,820 INFO L82 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2019-01-02 00:19:23,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:23,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:23,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:23,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:23,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:23,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:19:23,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:19:23,829 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:19:23,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:19:23,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:19:23,834 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-02 00:19:23,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:19:23,850 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-01-02 00:19:23,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:19:23,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2019-01-02 00:19:23,853 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:19:23,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-01-02 00:19:23,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:19:23,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:19:23,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:19:23,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:19:23,854 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:23,854 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:23,854 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:23,854 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:19:23,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:19:23,855 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:19:23,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:19:23,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:19:23 BoogieIcfgContainer [2019-01-02 00:19:23,861 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:19:23,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:19:23,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:19:23,862 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:19:23,863 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:18" (3/4) ... [2019-01-02 00:19:23,865 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:19:23,866 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:19:23,866 INFO L168 Benchmark]: Toolchain (without parser) took 6342.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:23,868 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:23,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:23,869 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:23,870 INFO L168 Benchmark]: Boogie Preprocessor took 35.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:23,870 INFO L168 Benchmark]: RCFGBuilder took 554.57 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.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:23,871 INFO L168 Benchmark]: BuchiAutomizer took 4956.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.8 MB). Peak memory consumption was 54.2 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:23,872 INFO L168 Benchmark]: Witness Printer took 3.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:23,877 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 724.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.58 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. * Boogie Preprocessor took 35.70 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 554.57 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.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4956.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.8 MB). Peak memory consumption was 54.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.91 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. * 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 4.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 37 SDtfs, 26 SDslu, 23 SDs, 0 SdLazy, 16 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf98 lsp97 ukn76 mio100 lsp41 div100 bol100 ite100 ukn100 eq187 hnf88 smp100 dnf240 smp97 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 73ms VariablesStem: 10 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...