./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_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/openbsd_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 a1d6cfff045b28bc8ee21f2bd02d3a692acdf01a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:20:26,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:20:26,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:20:26,136 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:20:26,136 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:20:26,141 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:20:26,142 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:20:26,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:20:26,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:20:26,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:20:26,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:20:26,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:20:26,152 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:20:26,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:20:26,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:20:26,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:20:26,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:20:26,158 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:20:26,160 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:20:26,161 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:20:26,162 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:20:26,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:20:26,166 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:20:26,166 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:20:26,167 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:20:26,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:20:26,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:20:26,171 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:20:26,172 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:20:26,173 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:20:26,173 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:20:26,174 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:20:26,174 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:20:26,175 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:20:26,176 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:20:26,176 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:20:26,177 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:20:26,195 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:20:26,195 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:20:26,196 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:20:26,196 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:20:26,197 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:20:26,197 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:20:26,197 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:20:26,197 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:20:26,198 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:20:26,198 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:20:26,198 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:20:26,198 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:20:26,199 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:20:26,199 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:20:26,199 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:20:26,199 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:20:26,199 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:20:26,200 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:20:26,200 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:20:26,200 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:20:26,200 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:20:26,200 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:20:26,201 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:20:26,201 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:20:26,201 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:20:26,201 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:20:26,201 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:20:26,202 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:20:26,202 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:20:26,202 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:20:26,202 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:20:26,203 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:20:26,204 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 -> a1d6cfff045b28bc8ee21f2bd02d3a692acdf01a [2019-01-02 00:20:26,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:20:26,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:20:26,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:20:26,256 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:20:26,256 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:20:26,257 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:26,318 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/693293c5e/bf2812b03ab34e839f78d066f0eb3e4d/FLAGb782b6496 [2019-01-02 00:20:26,818 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:20:26,819 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:26,841 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/693293c5e/bf2812b03ab34e839f78d066f0eb3e4d/FLAGb782b6496 [2019-01-02 00:20:27,135 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/693293c5e/bf2812b03ab34e839f78d066f0eb3e4d [2019-01-02 00:20:27,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:20:27,143 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:20:27,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:20:27,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:20:27,149 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:20:27,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:20:27" (1/1) ... [2019-01-02 00:20:27,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74386c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:27, skipping insertion in model container [2019-01-02 00:20:27,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:20:27" (1/1) ... [2019-01-02 00:20:27,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:20:27,205 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:20:27,634 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:20:27,646 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:20:27,821 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:20:27,878 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:20:27,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:27 WrapperNode [2019-01-02 00:20:27,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:20:27,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:20:27,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:20:27,880 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:20:27,889 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:20:27" (1/1) ... [2019-01-02 00:20:27,905 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:20:27" (1/1) ... [2019-01-02 00:20:27,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:20:27,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:20:27,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:20:27,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:20:27,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:27" (1/1) ... [2019-01-02 00:20:27,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:27" (1/1) ... [2019-01-02 00:20:27,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:27" (1/1) ... [2019-01-02 00:20:27,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:27" (1/1) ... [2019-01-02 00:20:27,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:27" (1/1) ... [2019-01-02 00:20:27,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:27" (1/1) ... [2019-01-02 00:20:27,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:27" (1/1) ... [2019-01-02 00:20:27,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:20:27,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:20:27,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:20:27,990 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:20:27,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:20:28,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:20:28,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:20:28,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:20:28,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:20:28,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:20:28,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:20:28,487 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:20:28,487 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-02 00:20:28,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:28 BoogieIcfgContainer [2019-01-02 00:20:28,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:20:28,489 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:20:28,489 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:20:28,496 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:20:28,497 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:28,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:20:27" (1/3) ... [2019-01-02 00:20:28,498 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a02e9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:20:28, skipping insertion in model container [2019-01-02 00:20:28,498 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:28,499 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:27" (2/3) ... [2019-01-02 00:20:28,499 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a02e9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:20:28, skipping insertion in model container [2019-01-02 00:20:28,499 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:28,499 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:28" (3/3) ... [2019-01-02 00:20:28,501 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:28,569 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:20:28,569 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:20:28,570 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:20:28,570 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:20:28,570 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:20:28,570 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:20:28,570 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:20:28,571 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:20:28,571 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:20:28,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-01-02 00:20:28,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-02 00:20:28,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:28,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:28,640 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:20:28,640 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:20:28,640 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:20:28,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-01-02 00:20:28,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-02 00:20:28,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:28,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:28,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:20:28,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:20:28,654 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13.base, main_#t~ret13.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~nondet8;havoc main_#t~nondet8;main_~length2~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~n~0 := main_#t~nondet10;havoc main_#t~nondet10; 18#L561true assume !(main_~length1~0 < 1); 21#L561-2true assume !(main_~length2~0 < 1); 15#L564-1true assume !(main_~n~0 < 1); 7#L567-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc12.base, main_#t~malloc12.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~dst.base, cstrncat_#in~dst.offset, cstrncat_#in~src.base, cstrncat_#in~src.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~post5.base, cstrncat_#t~post5.offset, cstrncat_#t~mem6, cstrncat_#t~post7.base, cstrncat_#t~post7.offset, cstrncat_#t~pre4, cstrncat_~d~0.base, cstrncat_~d~0.offset, cstrncat_~s~0.base, cstrncat_~s~0.offset, cstrncat_~dst.base, cstrncat_~dst.offset, cstrncat_~src.base, cstrncat_~src.offset, cstrncat_~n;cstrncat_~dst.base, cstrncat_~dst.offset := cstrncat_#in~dst.base, cstrncat_#in~dst.offset;cstrncat_~src.base, cstrncat_~src.offset := cstrncat_#in~src.base, cstrncat_#in~src.offset;cstrncat_~n := cstrncat_#in~n; 11#L543true assume 0 != cstrncat_~n % 4294967296;cstrncat_~d~0.base, cstrncat_~d~0.offset := cstrncat_~dst.base, cstrncat_~dst.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~src.base, cstrncat_~src.offset; 12#L546-3true [2019-01-02 00:20:28,659 INFO L796 eck$LassoCheckResult]: Loop: 12#L546-3true call cstrncat_#t~mem2 := read~int(cstrncat_~d~0.base, cstrncat_~d~0.offset, 1); 6#L546-1true assume !!(0 != cstrncat_#t~mem2);havoc cstrncat_#t~mem2;cstrncat_#t~post3.base, cstrncat_#t~post3.offset := cstrncat_~d~0.base, cstrncat_~d~0.offset;cstrncat_~d~0.base, cstrncat_~d~0.offset := cstrncat_#t~post3.base, 1 + cstrncat_#t~post3.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset; 12#L546-3true [2019-01-02 00:20:28,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:28,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939629, now seen corresponding path program 1 times [2019-01-02 00:20:28,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:28,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:28,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:28,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:28,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2019-01-02 00:20:28,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:28,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:28,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:28,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:28,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:28,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:28,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1302196946, now seen corresponding path program 1 times [2019-01-02 00:20:28,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:28,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:28,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:28,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:28,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:29,152 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-02 00:20:30,395 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2019-01-02 00:20:30,883 WARN L181 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-02 00:20:30,911 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:20:30,912 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:20:30,917 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:20:30,917 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:20:30,917 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:20:30,918 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:20:30,918 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:20:30,918 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:20:30,918 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-02 00:20:30,918 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:20:30,919 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:20:30,960 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:20:30,992 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:20:31,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:31,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:31,069 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:20:31,074 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:20:31,077 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:20:31,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:31,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:31,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:31,092 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:20:31,095 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:20:31,098 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:20:31,100 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:20:31,123 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:20:31,125 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:20:31,131 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:20:31,140 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:20:31,153 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:20:31,169 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:20:31,682 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-01-02 00:20:32,263 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-02 00:20:33,050 WARN L181 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-02 00:20:33,245 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:20:33,251 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:20:33,253 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:20:33,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,263 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:20:33,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,268 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:20:33,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:33,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:33,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,277 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:20:33,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,282 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:20:33,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,287 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:20:33,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,292 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:20:33,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,298 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:20:33,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,300 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:20:33,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:33,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:33,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,319 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:20:33,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,323 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:20:33,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,328 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:20:33,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,332 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:20:33,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,335 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:20:33,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,340 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:20:33,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,345 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:20:33,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,349 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:20:33,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,355 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:20:33,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,358 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:20:33,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:33,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:33,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:33,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,372 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:20:33,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,373 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:20:33,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,390 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:20:33,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:33,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:33,493 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:20:33,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:33,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:33,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:33,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:33,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:33,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:33,596 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:20:33,639 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-02 00:20:33,639 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-02 00:20:33,642 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:20:33,644 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:20:33,644 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:20:33,645 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncat_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1) = -1*ULTIMATE.start_cstrncat_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 Supporting invariants [] [2019-01-02 00:20:33,827 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-02 00:20:33,838 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:20:33,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:33,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:34,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:34,147 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:20:34,167 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-02 00:20:34,168 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 4 states. [2019-01-02 00:20:34,291 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 4 states. Result 46 states and 61 transitions. Complement of second has 9 states. [2019-01-02 00:20:34,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:20:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:20:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2019-01-02 00:20:34,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-02 00:20:34,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:34,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-02 00:20:34,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:34,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-02 00:20:34,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:34,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 61 transitions. [2019-01-02 00:20:34,302 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:20:34,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2019-01-02 00:20:34,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:20:34,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:20:34,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:20:34,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:20:34,307 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:20:34,307 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:20:34,307 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:20:34,307 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:20:34,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:20:34,307 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:20:34,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:20:34,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:20:34 BoogieIcfgContainer [2019-01-02 00:20:34,313 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:20:34,314 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:20:34,314 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:20:34,314 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:20:34,314 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:28" (3/4) ... [2019-01-02 00:20:34,319 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:20:34,320 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:20:34,320 INFO L168 Benchmark]: Toolchain (without parser) took 7178.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -126.8 MB). Peak memory consumption was 88.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:34,322 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:20:34,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:34,324 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.43 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:20:34,325 INFO L168 Benchmark]: Boogie Preprocessor took 52.99 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:20:34,325 INFO L168 Benchmark]: RCFGBuilder took 498.22 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:34,326 INFO L168 Benchmark]: BuchiAutomizer took 5824.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.4 MB). Peak memory consumption was 91.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:34,327 INFO L168 Benchmark]: Witness Printer took 6.14 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:20:34,332 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 735.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.43 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 52.99 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 498.22 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5824.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.4 MB). Peak memory consumption was 91.6 MB. Max. memory is 11.5 GB. * Witness Printer took 6.14 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 19 SDtfs, 21 SDslu, 19 SDs, 0 SdLazy, 17 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital215 mio100 ax100 hnf98 lsp97 ukn78 mio100 lsp42 div157 bol100 ite100 ukn100 eq169 hnf72 smp94 dnf219 smp97 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 119ms VariablesStem: 11 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...