./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_35643482-f9d3-4b5a-b2e1-f0a7a8f8198b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_35643482-f9d3-4b5a-b2e1-f0a7a8f8198b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_35643482-f9d3-4b5a-b2e1-f0a7a8f8198b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_35643482-f9d3-4b5a-b2e1-f0a7a8f8198b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_35643482-f9d3-4b5a-b2e1-f0a7a8f8198b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_35643482-f9d3-4b5a-b2e1-f0a7a8f8198b/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 32bit --witnessprinter.graph.data.programhash 12318f34040209c37cd54fcab38029595d0807d6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 22:07:11,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 22:07:11,019 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 22:07:11,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 22:07:11,025 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 22:07:11,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 22:07:11,026 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 22:07:11,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 22:07:11,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 22:07:11,029 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 22:07:11,029 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 22:07:11,030 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 22:07:11,030 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 22:07:11,031 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 22:07:11,032 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 22:07:11,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 22:07:11,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 22:07:11,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 22:07:11,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 22:07:11,036 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 22:07:11,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 22:07:11,038 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 22:07:11,039 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 22:07:11,039 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 22:07:11,040 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 22:07:11,040 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 22:07:11,041 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 22:07:11,042 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 22:07:11,042 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 22:07:11,043 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 22:07:11,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 22:07:11,044 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 22:07:11,044 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 22:07:11,044 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 22:07:11,044 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 22:07:11,045 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 22:07:11,045 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_35643482-f9d3-4b5a-b2e1-f0a7a8f8198b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-09 22:07:11,055 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 22:07:11,056 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 22:07:11,057 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 22:07:11,057 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 22:07:11,057 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 22:07:11,057 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-09 22:07:11,057 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-09 22:07:11,057 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-09 22:07:11,057 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-09 22:07:11,057 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-09 22:07:11,058 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-09 22:07:11,058 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 22:07:11,058 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 22:07:11,058 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 22:07:11,058 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 22:07:11,058 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 22:07:11,058 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 22:07:11,058 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-09 22:07:11,058 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-09 22:07:11,059 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-09 22:07:11,059 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 22:07:11,059 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 22:07:11,059 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-09 22:07:11,059 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-09 22:07:11,059 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 22:07:11,059 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 22:07:11,059 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-09 22:07:11,059 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 22:07:11,059 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 22:07:11,060 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-09 22:07:11,060 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-09 22:07:11,060 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_35643482-f9d3-4b5a-b2e1-f0a7a8f8198b/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12318f34040209c37cd54fcab38029595d0807d6 [2018-11-09 22:07:11,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 22:07:11,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 22:07:11,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 22:07:11,091 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 22:07:11,091 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 22:07:11,092 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_35643482-f9d3-4b5a-b2e1-f0a7a8f8198b/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-11-09 22:07:11,128 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35643482-f9d3-4b5a-b2e1-f0a7a8f8198b/bin-2019/uautomizer/data/d3776b0a9/86d29a8e5f0d44c384b93c54a00510ff/FLAG69e067cfc [2018-11-09 22:07:11,494 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 22:07:11,494 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_35643482-f9d3-4b5a-b2e1-f0a7a8f8198b/sv-benchmarks/c/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-11-09 22:07:11,503 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35643482-f9d3-4b5a-b2e1-f0a7a8f8198b/bin-2019/uautomizer/data/d3776b0a9/86d29a8e5f0d44c384b93c54a00510ff/FLAG69e067cfc [2018-11-09 22:07:11,513 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_35643482-f9d3-4b5a-b2e1-f0a7a8f8198b/bin-2019/uautomizer/data/d3776b0a9/86d29a8e5f0d44c384b93c54a00510ff [2018-11-09 22:07:11,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 22:07:11,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-09 22:07:11,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 22:07:11,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 22:07:11,519 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 22:07:11,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:07:11" (1/1) ... [2018-11-09 22:07:11,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126fd608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:11, skipping insertion in model container [2018-11-09 22:07:11,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:07:11" (1/1) ... [2018-11-09 22:07:11,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 22:07:11,553 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 22:07:11,729 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:07:11,735 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 22:07:11,764 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:07:11,786 INFO L193 MainTranslator]: Completed translation [2018-11-09 22:07:11,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:11 WrapperNode [2018-11-09 22:07:11,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 22:07:11,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-09 22:07:11,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-09 22:07:11,787 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-09 22:07:11,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:11" (1/1) ... [2018-11-09 22:07:11,847 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:11" (1/1) ... [2018-11-09 22:07:11,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-09 22:07:11,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 22:07:11,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 22:07:11,864 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 22:07:11,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:11" (1/1) ... [2018-11-09 22:07:11,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:11" (1/1) ... [2018-11-09 22:07:11,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:11" (1/1) ... [2018-11-09 22:07:11,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:11" (1/1) ... [2018-11-09 22:07:11,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:11" (1/1) ... [2018-11-09 22:07:11,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:11" (1/1) ... [2018-11-09 22:07:11,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:11" (1/1) ... [2018-11-09 22:07:11,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 22:07:11,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 22:07:11,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 22:07:11,880 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 22:07:11,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35643482-f9d3-4b5a-b2e1-f0a7a8f8198b/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-11-09 22:07:11,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-09 22:07:11,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-09 22:07:11,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 22:07:11,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 22:07:12,063 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 22:07:12,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:07:12 BoogieIcfgContainer [2018-11-09 22:07:12,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 22:07:12,064 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-09 22:07:12,064 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-09 22:07:12,066 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-09 22:07:12,066 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:07:12,066 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 10:07:11" (1/3) ... [2018-11-09 22:07:12,067 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3260f6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 10:07:12, skipping insertion in model container [2018-11-09 22:07:12,067 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:07:12,067 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:11" (2/3) ... [2018-11-09 22:07:12,067 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3260f6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 10:07:12, skipping insertion in model container [2018-11-09 22:07:12,068 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:07:12,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:07:12" (3/3) ... [2018-11-09 22:07:12,069 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-11-09 22:07:12,104 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 22:07:12,104 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-09 22:07:12,105 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-09 22:07:12,105 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-09 22:07:12,105 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 22:07:12,105 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 22:07:12,105 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-09 22:07:12,105 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 22:07:12,105 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-09 22:07:12,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-09 22:07:12,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-09 22:07:12,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:07:12,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:07:12,137 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:07:12,137 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-09 22:07:12,137 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-09 22:07:12,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-09 22:07:12,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-09 22:07:12,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:07:12,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:07:12,139 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:07:12,139 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-09 22:07:12,146 INFO L793 eck$LassoCheckResult]: Stem: 13#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~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~length1~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 15#L551true assume !(main_~length1~0 < 1); 19#L551-2true assume !(main_~n~0 < 1); 11#L554-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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.offset; 4#L558true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L558 6#L558-1true assume { :begin_inline_cstrnlen } true;cstrnlen_#in~str.base, cstrnlen_#in~str.offset, cstrnlen_#in~maxlen := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~n~0;havoc cstrnlen_#res;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset, cstrnlen_#t~post3, cstrnlen_#t~mem4, cstrnlen_#t~short5, cstrnlen_~str.base, cstrnlen_~str.offset, cstrnlen_~maxlen, cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~str.base, cstrnlen_~str.offset := cstrnlen_#in~str.base, cstrnlen_#in~str.offset;cstrnlen_~maxlen := cstrnlen_#in~maxlen;havoc cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_~str.base, cstrnlen_~str.offset; 5#L544-8true [2018-11-09 22:07:12,147 INFO L795 eck$LassoCheckResult]: Loop: 5#L544-8true assume true;cstrnlen_#t~short5 := cstrnlen_~maxlen % 4294967296 != 0; 9#L544-1true assume !cstrnlen_#t~short5; 17#L544-5true assume !!cstrnlen_#t~short5;havoc cstrnlen_#t~mem4;havoc cstrnlen_#t~short5; 3#L544-7true cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset := cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset + 1;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset;cstrnlen_#t~post3 := cstrnlen_~maxlen;cstrnlen_~maxlen := cstrnlen_#t~post3 - 1;havoc cstrnlen_#t~post3; 5#L544-8true [2018-11-09 22:07:12,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:07:12,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935495, now seen corresponding path program 1 times [2018-11-09 22:07:12,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:07:12,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:07:12,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:07:12,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:07:12,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:07:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:07:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:07:12,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:07:12,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1577130, now seen corresponding path program 1 times [2018-11-09 22:07:12,245 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:07:12,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:07:12,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:07:12,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:07:12,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:07:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:07:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:07:12,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:07:12,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:07:12,287 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 22:07:12,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:07:12,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:07:12,297 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-11-09 22:07:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:07:12,313 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-11-09 22:07:12,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:07:12,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2018-11-09 22:07:12,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-09 22:07:12,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 13 states and 15 transitions. [2018-11-09 22:07:12,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-09 22:07:12,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-09 22:07:12,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-11-09 22:07:12,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:07:12,320 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-09 22:07:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-11-09 22:07:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-09 22:07:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-09 22:07:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-09 22:07:12,338 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-09 22:07:12,338 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-09 22:07:12,338 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-09 22:07:12,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-09 22:07:12,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-09 22:07:12,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:07:12,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:07:12,339 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:07:12,339 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-09 22:07:12,340 INFO L793 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 52#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~length1~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 53#L551 assume !(main_~length1~0 < 1); 58#L551-2 assume !(main_~n~0 < 1); 54#L554-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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.offset; 48#L558 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L558 49#L558-1 assume { :begin_inline_cstrnlen } true;cstrnlen_#in~str.base, cstrnlen_#in~str.offset, cstrnlen_#in~maxlen := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~n~0;havoc cstrnlen_#res;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset, cstrnlen_#t~post3, cstrnlen_#t~mem4, cstrnlen_#t~short5, cstrnlen_~str.base, cstrnlen_~str.offset, cstrnlen_~maxlen, cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~str.base, cstrnlen_~str.offset := cstrnlen_#in~str.base, cstrnlen_#in~str.offset;cstrnlen_~maxlen := cstrnlen_#in~maxlen;havoc cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_~str.base, cstrnlen_~str.offset; 47#L544-8 [2018-11-09 22:07:12,340 INFO L795 eck$LassoCheckResult]: Loop: 47#L544-8 assume true;cstrnlen_#t~short5 := cstrnlen_~maxlen % 4294967296 != 0; 50#L544-1 assume cstrnlen_#t~short5; 51#L544-2 SUMMARY for call cstrnlen_#t~mem4 := read~int(cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset, 1); srcloc: L544-2 55#L544-3 cstrnlen_#t~short5 := cstrnlen_#t~mem4 != 0; 57#L544-5 assume !!cstrnlen_#t~short5;havoc cstrnlen_#t~mem4;havoc cstrnlen_#t~short5; 46#L544-7 cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset := cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset + 1;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset;cstrnlen_#t~post3 := cstrnlen_~maxlen;cstrnlen_~maxlen := cstrnlen_#t~post3 - 1;havoc cstrnlen_#t~post3; 47#L544-8 [2018-11-09 22:07:12,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:07:12,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935495, now seen corresponding path program 2 times [2018-11-09 22:07:12,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:07:12,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:07:12,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:07:12,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:07:12,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:07:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:07:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:07:12,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:07:12,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1511651207, now seen corresponding path program 1 times [2018-11-09 22:07:12,362 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:07:12,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:07:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:07:12,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:07:12,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:07:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:07:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:07:12,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:07:12,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1104130253, now seen corresponding path program 1 times [2018-11-09 22:07:12,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:07:12,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:07:12,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:07:12,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:07:12,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:07:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:07:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:07:12,642 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-11-09 22:07:12,698 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:07:12,698 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:07:12,699 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:07:12,699 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:07:12,699 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 22:07:12,699 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:07:12,699 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:07:12,699 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:07:12,699 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-09 22:07:12,699 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:07:12,699 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:07:12,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:07:12,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:07:12,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:07:12,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:07:12,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:07:12,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:07:12,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:07:12,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:07:12,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:07:12,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:07:12,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:07:12,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:07:12,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:07:12,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:07:13,221 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:07:13,225 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 22:07:13,226 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-11-09 22:07:13,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:07:13,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:07:13,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:07:13,231 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,231 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-11-09 22:07:13,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:07:13,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:07:13,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:07:13,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,234 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-11-09 22:07:13,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:07:13,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:07:13,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:07:13,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,236 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-11-09 22:07:13,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:07:13,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:07:13,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:07:13,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,238 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-11-09 22:07:13,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:07:13,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:07:13,243 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,243 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-11-09 22:07:13,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:07:13,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:07:13,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:07:13,246 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,246 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-11-09 22:07:13,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:07:13,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:07:13,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:07:13,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,249 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-11-09 22:07:13,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:07:13,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:07:13,255 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,255 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-11-09 22:07:13,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:07:13,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:07:13,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,264 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-11-09 22:07:13,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,266 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:07:13,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,270 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:07:13,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:07:13,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,290 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-11-09 22:07:13,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:07:13,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:07:13,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,297 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-11-09 22:07:13,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:07:13,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,298 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 22:07:13,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,298 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 22:07:13,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:07:13,303 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,303 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-11-09 22:07:13,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:07:13,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:07:13,312 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,313 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-11-09 22:07:13,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:07:13,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:07:13,319 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,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 [2018-11-09 22:07:13,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:07:13,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:07:13,333 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:07:13,333 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-11-09 22:07:13,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:07:13,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:07:13,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:07:13,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:07:13,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:07:13,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:07:13,384 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 22:07:13,403 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-09 22:07:13,403 INFO L444 ModelExtractionUtils]: 24 out of 34 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-09 22:07:13,405 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 22:07:13,407 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 22:07:13,407 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 22:07:13,408 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrnlen_~cp~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1) = -1*ULTIMATE.start_cstrnlen_~cp~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 Supporting invariants [] [2018-11-09 22:07:13,423 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-09 22:07:13,429 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-09 22:07:13,431 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-09 22:07:13,431 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-09 22:07:13,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:07:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:07:13,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:07:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:07:13,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:07:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:07:13,507 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 [2018-11-09 22:07:13,508 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-09 22:07:13,538 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 19 states and 22 transitions. Complement of second has 7 states. [2018-11-09 22:07:13,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 22:07:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-09 22:07:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-09 22:07:13,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-09 22:07:13,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:07:13,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-09 22:07:13,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:07:13,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 7 letters. Loop has 12 letters. [2018-11-09 22:07:13,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:07:13,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2018-11-09 22:07:13,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:07:13,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2018-11-09 22:07:13,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 22:07:13,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 22:07:13,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 22:07:13,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:07:13,543 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:07:13,543 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:07:13,543 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:07:13,543 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-09 22:07:13,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-09 22:07:13,543 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:07:13,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-09 22:07:13,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 10:07:13 BoogieIcfgContainer [2018-11-09 22:07:13,547 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-09 22:07:13,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 22:07:13,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 22:07:13,547 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 22:07:13,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:07:12" (3/4) ... [2018-11-09 22:07:13,550 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-09 22:07:13,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 22:07:13,550 INFO L168 Benchmark]: Toolchain (without parser) took 2035.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:07:13,551 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:07:13,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.65 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 932.9 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-09 22:07:13,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 932.9 MB in the beginning and 1.1 GB in the end (delta: -208.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-09 22:07:13,552 INFO L168 Benchmark]: Boogie Preprocessor took 15.62 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-11-09 22:07:13,552 INFO L168 Benchmark]: RCFGBuilder took 183.46 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-09 22:07:13,553 INFO L168 Benchmark]: BuchiAutomizer took 1483.17 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: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2018-11-09 22:07:13,553 INFO L168 Benchmark]: Witness Printer took 2.76 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. [2018-11-09 22:07:13,556 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.65 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 932.9 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 932.9 MB in the beginning and 1.1 GB in the end (delta: -208.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.62 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 183.46 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1483.17 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: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.76 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.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * cp + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 16 SDslu, 25 SDs, 0 SdLazy, 13 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital144 mio100 ax100 hnf98 lsp81 ukn110 mio100 lsp39 div119 bol100 ite100 ukn100 eq165 hnf88 smp100 dnf101 smp100 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 6 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...