./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_47824797-c627-42fc-b658-a141fb53bd69/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_47824797-c627-42fc-b658-a141fb53bd69/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_47824797-c627-42fc-b658-a141fb53bd69/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_47824797-c627-42fc-b658-a141fb53bd69/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_47824797-c627-42fc-b658-a141fb53bd69/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_47824797-c627-42fc-b658-a141fb53bd69/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 68c0bffd453ebe82049c8a49e9fddf725cfb9d95 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:08:36,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:36,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:36,159 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:36,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:36,163 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:36,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:36,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:36,173 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:36,174 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:36,175 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:36,175 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:36,176 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:36,177 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:36,178 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:36,179 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:36,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:36,182 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:36,184 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:36,186 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:36,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:36,188 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:36,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:36,191 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:36,191 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:36,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:36,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:36,194 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:36,195 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:36,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:36,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:36,196 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:36,197 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:36,197 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:36,198 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:36,199 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:36,199 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_47824797-c627-42fc-b658-a141fb53bd69/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:08:36,214 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:36,214 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:36,215 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:08:36,216 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:08:36,216 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:08:36,216 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:08:36,216 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:08:36,216 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:08:36,217 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:08:36,217 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:08:36,217 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:08:36,218 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:36,218 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:08:36,219 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:36,219 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:36,219 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:08:36,219 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:08:36,219 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:08:36,219 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:36,220 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:08:36,220 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:08:36,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:36,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:36,220 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:08:36,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:36,221 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:08:36,221 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:08:36,222 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:08:36,222 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_47824797-c627-42fc-b658-a141fb53bd69/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68c0bffd453ebe82049c8a49e9fddf725cfb9d95 [2018-10-27 06:08:36,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:36,266 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:36,269 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:36,271 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:36,271 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:36,272 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_47824797-c627-42fc-b658-a141fb53bd69/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca_true-termination.c.i [2018-10-27 06:08:36,329 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47824797-c627-42fc-b658-a141fb53bd69/bin-2019/uautomizer/data/5c2c43be4/56cfc7fc4c1c4d30995a66643b4e44f2/FLAGe496ba285 [2018-10-27 06:08:36,810 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:36,810 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_47824797-c627-42fc-b658-a141fb53bd69/sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca_true-termination.c.i [2018-10-27 06:08:36,823 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47824797-c627-42fc-b658-a141fb53bd69/bin-2019/uautomizer/data/5c2c43be4/56cfc7fc4c1c4d30995a66643b4e44f2/FLAGe496ba285 [2018-10-27 06:08:36,837 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_47824797-c627-42fc-b658-a141fb53bd69/bin-2019/uautomizer/data/5c2c43be4/56cfc7fc4c1c4d30995a66643b4e44f2 [2018-10-27 06:08:36,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:36,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:08:36,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:36,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:36,846 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:36,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:36" (1/1) ... [2018-10-27 06:08:36,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ad6102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:36, skipping insertion in model container [2018-10-27 06:08:36,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:36" (1/1) ... [2018-10-27 06:08:36,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:36,899 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:37,178 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:37,188 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:37,229 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:37,273 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:37,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:37 WrapperNode [2018-10-27 06:08:37,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:37,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:37,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:37,275 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:37,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:37" (1/1) ... [2018-10-27 06:08:37,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:37" (1/1) ... [2018-10-27 06:08:37,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:37,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:37,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:37,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:37,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:37" (1/1) ... [2018-10-27 06:08:37,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:37" (1/1) ... [2018-10-27 06:08:37,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:37" (1/1) ... [2018-10-27 06:08:37,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:37" (1/1) ... [2018-10-27 06:08:37,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:37" (1/1) ... [2018-10-27 06:08:37,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:37" (1/1) ... [2018-10-27 06:08:37,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:37" (1/1) ... [2018-10-27 06:08:37,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:37,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:37,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:37,447 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:37,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47824797-c627-42fc-b658-a141fb53bd69/bin-2019/uautomizer/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 [2018-10-27 06:08:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:08:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:08:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:38,020 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:38,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:38 BoogieIcfgContainer [2018-10-27 06:08:38,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:38,022 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:08:38,022 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:08:38,026 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:08:38,026 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:38,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:08:36" (1/3) ... [2018-10-27 06:08:38,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16861691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:38, skipping insertion in model container [2018-10-27 06:08:38,028 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:38,028 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:37" (2/3) ... [2018-10-27 06:08:38,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16861691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:38, skipping insertion in model container [2018-10-27 06:08:38,028 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:38,029 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:38" (3/3) ... [2018-10-27 06:08:38,032 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncmp-alloca_true-termination.c.i [2018-10-27 06:08:38,094 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:08:38,094 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:08:38,095 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:08:38,095 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:08:38,095 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:38,096 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:38,096 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:08:38,096 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:38,096 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:08:38,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-10-27 06:08:38,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-10-27 06:08:38,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:38,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:38,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:38,145 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:38,145 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:08:38,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-10-27 06:08:38,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-10-27 06:08:38,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:38,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:38,150 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:38,150 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:38,158 INFO L793 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 23#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset; 27#L573true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 29#L573-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 11#L574true assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 15#L550true assume !(cstrncmp_~n == 0); 8#L552-9true [2018-10-27 06:08:38,158 INFO L795 eck$LassoCheckResult]: Loop: 8#L552-9true assume true; 13#L552-1true cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 16#L552-2true assume !cstrncmp_#t~short5; 7#L552-7true assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem3;cstrncmp_#t~short7 := cstrncmp_~n == 0; 24#L553true assume cstrncmp_#t~short7; 32#L553-4true assume !cstrncmp_#t~short7;havoc cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset + 1;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset + 1;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 8#L552-9true [2018-10-27 06:08:38,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:38,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1298223692, now seen corresponding path program 1 times [2018-10-27 06:08:38,170 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:38,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:38,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:38,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:38,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1688417939, now seen corresponding path program 1 times [2018-10-27 06:08:38,332 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:38,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:38,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:38,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:38,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:38,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:08:38,402 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:38,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:08:38,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:38,418 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-10-27 06:08:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:38,462 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-10-27 06:08:38,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:08:38,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-10-27 06:08:38,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-10-27 06:08:38,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 23 transitions. [2018-10-27 06:08:38,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:08:38,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:08:38,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-10-27 06:08:38,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:38,474 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-10-27 06:08:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-10-27 06:08:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-27 06:08:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-27 06:08:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-10-27 06:08:38,502 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-10-27 06:08:38,502 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-10-27 06:08:38,502 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:08:38,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-10-27 06:08:38,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-10-27 06:08:38,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:38,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:38,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:38,504 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:38,504 INFO L793 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 80#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 76#L565 assume !(main_~length1~0 < 1); 77#L565-2 assume !(main_~length2~0 < 1); 73#L568-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset; 74#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 86#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 83#L574 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 84#L550 assume !(cstrncmp_~n == 0); 78#L552-9 [2018-10-27 06:08:38,505 INFO L795 eck$LassoCheckResult]: Loop: 78#L552-9 assume true; 79#L552-1 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 88#L552-2 assume cstrncmp_#t~short5; 89#L552-3 SUMMARY for call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1); srcloc: L552-3 70#L552-4 SUMMARY for call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1); srcloc: L552-4 71#L552-5 cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 72#L552-7 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem3;cstrncmp_#t~short7 := cstrncmp_~n == 0; 75#L553 assume cstrncmp_#t~short7; 82#L553-4 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset + 1;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset + 1;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 78#L552-9 [2018-10-27 06:08:38,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:38,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1298223692, now seen corresponding path program 2 times [2018-10-27 06:08:38,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:38,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:38,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:38,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:38,549 INFO L82 PathProgramCache]: Analyzing trace with hash 856309616, now seen corresponding path program 1 times [2018-10-27 06:08:38,549 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:38,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:38,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:38,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:38,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:38,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:08:38,616 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:38,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:08:38,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:38,617 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-10-27 06:08:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:38,686 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-10-27 06:08:38,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:08:38,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2018-10-27 06:08:38,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-10-27 06:08:38,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 22 transitions. [2018-10-27 06:08:38,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:08:38,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:08:38,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-10-27 06:08:38,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:38,691 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-10-27 06:08:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-10-27 06:08:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-27 06:08:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-27 06:08:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-10-27 06:08:38,693 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-10-27 06:08:38,693 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-10-27 06:08:38,693 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:38,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2018-10-27 06:08:38,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-10-27 06:08:38,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:38,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:38,694 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:38,694 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:38,695 INFO L793 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 127#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 123#L565 assume !(main_~length1~0 < 1); 124#L565-2 assume !(main_~length2~0 < 1); 120#L568-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset; 121#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 132#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 129#L574 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 130#L550 assume !(cstrncmp_~n == 0); 125#L552-9 [2018-10-27 06:08:38,695 INFO L795 eck$LassoCheckResult]: Loop: 125#L552-9 assume true; 126#L552-1 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 133#L552-2 assume cstrncmp_#t~short5; 135#L552-3 SUMMARY for call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1); srcloc: L552-3 117#L552-4 SUMMARY for call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1); srcloc: L552-4 118#L552-5 cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 119#L552-7 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem3;cstrncmp_#t~short7 := cstrncmp_~n == 0; 122#L553 assume !cstrncmp_#t~short7; 128#L553-2 SUMMARY for call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1); srcloc: L553-2 134#L553-3 cstrncmp_#t~short7 := cstrncmp_#t~mem6 == 0; 136#L553-4 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset + 1;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset + 1;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 125#L552-9 [2018-10-27 06:08:38,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:38,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1298223692, now seen corresponding path program 3 times [2018-10-27 06:08:38,695 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:38,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:38,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1720125395, now seen corresponding path program 1 times [2018-10-27 06:08:38,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:38,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:38,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:38,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:38,762 INFO L82 PathProgramCache]: Analyzing trace with hash -42215166, now seen corresponding path program 1 times [2018-10-27 06:08:38,762 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:38,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:38,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:38,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,675 WARN L179 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2018-10-27 06:08:39,863 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 06:08:40,434 WARN L179 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2018-10-27 06:08:40,579 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-10-27 06:08:40,589 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:40,590 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:40,591 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:40,591 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:40,591 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:40,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:40,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:40,591 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:40,592 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:08:40,592 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:40,592 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:40,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:40,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,154 WARN L179 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2018-10-27 06:08:41,385 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2018-10-27 06:08:41,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:41,983 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-27 06:08:42,440 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:42,445 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:42,448 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 [2018-10-27 06:08:42,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:42,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:42,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:42,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:42,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:42,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:42,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:42,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:42,458 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 [2018-10-27 06:08:42,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:42,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:42,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:42,459 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:42,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:42,460 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:42,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:42,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:42,467 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 [2018-10-27 06:08:42,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:42,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:42,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:42,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:42,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:42,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:42,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:42,490 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 [2018-10-27 06:08:42,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:42,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:42,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:42,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:42,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:42,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:42,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:42,500 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 [2018-10-27 06:08:42,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:42,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:42,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:42,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:42,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:42,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:42,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:42,528 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 [2018-10-27 06:08:42,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:42,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:42,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:42,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:42,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:42,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:42,618 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:42,698 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:08:42,708 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:08:42,710 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:42,712 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:42,712 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:42,712 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc15.base)_1, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc15.base)_1 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2018-10-27 06:08:42,978 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-10-27 06:08:42,985 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:08:43,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:43,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:43,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:43,106 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-10-27 06:08:43,107 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-10-27 06:08:43,170 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 3. Second operand 6 states. Result 31 states and 34 transitions. Complement of second has 8 states. [2018-10-27 06:08:43,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:08:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-10-27 06:08:43,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 9 letters. Loop has 11 letters. [2018-10-27 06:08:43,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:43,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 20 letters. Loop has 11 letters. [2018-10-27 06:08:43,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:43,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 9 letters. Loop has 22 letters. [2018-10-27 06:08:43,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:43,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 34 transitions. [2018-10-27 06:08:43,178 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:43,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-10-27 06:08:43,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:08:43,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:08:43,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:08:43,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:43,178 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:43,178 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:43,179 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:43,179 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:43,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:08:43,179 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:43,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:08:43,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:08:43 BoogieIcfgContainer [2018-10-27 06:08:43,185 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:08:43,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:08:43,186 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:08:43,186 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:08:43,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:38" (3/4) ... [2018-10-27 06:08:43,190 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:08:43,190 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:08:43,191 INFO L168 Benchmark]: Toolchain (without parser) took 6350.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 957.1 MB in the beginning and 869.8 MB in the end (delta: 87.3 MB). Peak memory consumption was 218.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:43,192 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:43,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.55 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 935.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:43,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -193.8 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:43,194 INFO L168 Benchmark]: Boogie Preprocessor took 26.94 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:43,194 INFO L168 Benchmark]: RCFGBuilder took 574.98 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: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:43,195 INFO L168 Benchmark]: BuchiAutomizer took 5163.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 869.8 MB in the end (delta: 233.8 MB). Peak memory consumption was 233.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:43,195 INFO L168 Benchmark]: Witness Printer took 4.30 ms. Allocated memory is still 1.2 GB. Free memory is still 869.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:43,201 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 432.55 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 935.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 143.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -193.8 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.94 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 574.98 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: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5163.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 869.8 MB in the end (delta: 233.8 MB). Peak memory consumption was 233.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.30 ms. Allocated memory is still 1.2 GB. Free memory is still 869.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 75 SDtfs, 23 SDslu, 68 SDs, 0 SdLazy, 25 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital239 mio100 ax107 hnf99 lsp82 ukn109 mio100 lsp43 div100 bol100 ite100 ukn100 eq201 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...